Dutch composer Peter Schat’s (1935-2003) pursuit of a compositional system that could generate and preserve intervallic relationships, while allowing the composer as much flexibility as possible to manipulate musical material, led him to develop the tone-clock system. Fundamentally comprised of the twelve possible trichords, the tone clock permits each to generate a complete twelve-tone series through the “steering” principle, a concept traced to Boulez’s technique of pitch-class set multiplication. This study serves as an overview of Schat’s tone-clock system and focuses primarily on the effects of the steering function in “Genen” (2000). Furthermore, I expand on the tone-clock system by combining transformational theory with Julian Hook’s uniform triadic transformations and my proposed STEER and STEERS functions, which express the procedures of the steering principle as a mathematical formula. Using a series of transformational networks, I illustrate the unifying effect steering has on different structural levels in “Genen,” a post-tonal composition.

La thèse porte sur les deux thèmes des Jeux combinatoires et de la théorie des graphes. Elle est divisée en deux parties.1) Le jeu de Domination et ses variantes: Il s'agit d'un jeu combinatoire qui consiste à marquer les sommets d'un graphe de telle sorte qu'un sommet marqué n'ait aucun voisin marqué. Le joueur marquant le dernier sommet est déclaré gagnant. Le calcul des stratégies gagnantes étant NP-difficile pour un graphe quelconque, nous avons étudié des familles particulières de graphes comme les chemins, les scies ou les chenilles. Pour ces familles on peut savoir en temps polynomial si un graphe est perdant. Nous avons également étudié 28 variantes du jeu de domination, dont les 12 variantes définies par J. Conway sur un jeu combinatoire quelconque. 2) Le nombre chromatique ludique des arbres: Ce paramètre est calculé à partir d'un jeu de coloration où Alice et Bob colorient alternativement et proprement un sommet d'un graphe G avec l'une des k couleurs. L'objectif d'Alice est de colorier complètement le graphe alors que Bob doit l'en empêcher. Nous nous sommes intéressés au jeu avec 3 couleurs sur un arbre T. Nous souhaitons déterminer les arbres ayant un nombre chromatique ludique 3, soit ceux pour lesquels Alice a une stratégie gagnante avec 3 couleurs. Ce problème semblant difficile à résoudre sur les arbres, nous avons résolu des sous-familles: les 1-chenilles puis les chenilles sans trous. / Part 1: Domination Game and its variantsDomination game is a combinatorial game that consists in marking vertices of a graph so that a marked vertex has no marked neighbors. The first player unable to mark a vertex loses the game.Since the computing of winning strategies is an NP-hard problem for any graphs, we examine some specific families of graphs such as complete k-partite graphs, paths or saws. For these families, we establish the set of losing elements. For other families, such as caterpillars, we prove that exists a polynomial algorithm for the computation of outcome and winning strategies. No polynomial algorithm has been found to date for more general families, such as trees.We also study 28 variants of Domination game, including the 12 variants defined by J. Conway for any combinatorial game. Using game functions, we find the set of losing paths for 10 of these 12 variants. We also investigate 16 variants called diameter, for instance when rules require to play on the component that has the largest diameter.Part 2: The game chromatic number of treesThis parameter is computed from a coloring game: Alice and Bob alternatively color the vertices of a graph G, using one of the k colors in the color set. Alice has to achieve the coloring of the entire graph whereas Bob has to prevent this. Faigle and al. proved that the game chromatic number of a tree is at most 4. We undertake characterization of trees with a game chromatic number of 3. Since this problem seems difficult for general trees, we focus on sub-families: 1-caterpillars and caterpillars without holes.For these families we provide the characterization and also compute winning strategies for Alice and Bob. In order to do so, we are led to define a new notion, the bitype, that for a partially-colored graph G associates two letters indicating who has a winning strategy respectively on G and G with an isolated vertex. Bitypes allow us to demonstrate several properties, in particular to compute the game chromatic number of a graph from the bitypes of its connected components.

Orientador: José Alfredo Covolan Ulson / Resumo: O leite é um alimento de alto valor nutritivo e de extrema importância na dieta alimentar especialmente de gestantes, crianças e idosos. Entre os alimentos mais consumidos está o leite bovino, o qual tem sido alvo de adulterações por diversas substâncias em todo o mundo por motivações econômicas, muitas vezes colocando em risco a saúde do consumidor. No controle de adulterações no leite, sensores aplicados na indústria alimentícia são ferramentas importantes para o controle de qualidade. Atualmente, as análises disponíveis no mercado para verificação de possíveis adulterações no leite geralmente são custosas e/ou demoradas, devido a necessidade de ambiente laboratorial e utilização de equipamentos de alto valor. Portanto, é de extrema importância, o desenvolvimento de metodologias e sensores de triagem para identificação de adulterantes no leite que sejam viáveis economicamente e de fácil acesso e utilização. Neste intuito, este estudo utilizou diafragmas transdutores piezelétricos para implementar uma metodologia que identificasse adulterações no leite por meio do método de propagação de ondas mecânicas (vibração e emissão acústica). Leite pasteurizado puro e padronizado e três substâncias comumente encontradas nos casos de adulteração do leite (peróxido de hidrogênio, ureia e bicarbonato de sódio) foram utilizados para as análises. Foi desenvolvido em impressora 3D um dispositivo para a inserção das amostras de leite a serem analisadas, onde dois diafragmas piezelétricos fo... (Resumo completo, clicar acesso eletrônico abaixo) / Abstract: Milk is a food with high nutritional value and extremely important in the diet especially for pregnant women, children and the elderly. Among the most consumed foods is beef milk, which has been tampered with by various substances around the world for economic reasons, often endangering consumer health. In the control of milk adulteration, sensors applied in the food industry are important tools for quality control. Currently, commercially available analyzes for possible milk adulteration are costly and/or time consuming, due to the need for laboratory environment and use of high value equipment. Thus, is of utmost important to develop methodologies and screening sensors for the identification of milk adulteration that are economically viable and easy to access and use. To this end, this study used piezoelectric transducer diaphragms to implement a methodology which identify milk adulterations through the mechanical wave propagation method (vibration and acoustic emission). Pure and standardized pasteurized milk and three substances commonly found in cases of milk adulteration (hydrogen peroxide, urea and sodium bicarbonate) were used for the analyzes. A device was developed in 3D printer for the insertion of milk samples to be analyzed, where two piezoelectric diaphragms were adapted. The first was excited by a chirp signal with 1 V of amplitude and a frequency band from 0 to 65 kHz with 2 Hz pitch and 1.2 second duration, and concomitantly acquired the response signal of th... (Complete abstract click electronic access below) / Mestre

An area in graph theory is graph colouring, which essentially is a labeling of the vertices or edges according to certain constraints. In this thesis we consider star edge colouring, which is a variant of proper edge colouring where we additionally require the graph to have no two-coloured paths or cycles with length 4. The smallest number of colours needed to colour a graph G with a star edge colouring is called the star chromatic index of G and is denoted <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Cchi'_%7Bst%7D(G)" />. This paper proves an upper bound of the star chromatic index of bipartite graphs in terms of the maximum degree; the maximum degree of G is the largest number of edges incident to a single vertex in G. For bipartite graphs Bk with maximum degree <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?k%5Cgeq1" />, the star chromatic index is proven to satisfy<img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%20%5Cchi'_%7Bst%7D(B_k)%20%5Cleq%20k%5E2%20-%20k%20+%201" />. For bipartite graphs <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?B_%7Bk,n%7D" />, where all vertices in one part have degree n, and all vertices in the other part have degree k, it is proven that the star chromatic index satisfies <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Cchi'_%7Bst%7D(Bk,n)%20%5Cleq%20k%5E2%20-2k%20+%20n%20+%201,%20k%20%5Cgeq%20n%20%3E%201" />. We also prove an upper bound for a special case of multipartite graphs, namely <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?K_%7Bn,1,1,%5Cdots,1%7D" /> with m parts of size one. The star chromatic index of such a graph satisfies<img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Cchi'_%7Bst%7D(K_%7Bn,1,1,%5Cdots,1%7D)%20%5Cleq%2015%5Clceil%5Cfrac%7Bn%7D%7B8%7D%5Crceil%5Ccdot%5Clceil%5Cfrac%7Bm%7D%7B8%7D%5Crceil%20+%20%5Cfrac%7B1%7D%7B2%7Dm(m-1),%5C,m%20%5Cgeq%205" />. For complete multipartite graphs where m &lt; 5, we prove lower upper bounds than the one above.

The work deals with dispersive effects of single mode fibers. We learn about the chromatic dispersion, the main attention is paid to the Polarization Mode Dispersion. We clarify the root cause origin of the Polarization Mode Dispersion describing parameters and its effect on transmitted data. Further on, the works dedicates to measure methods of the Polarization Mode Dispersion which is the interferometric method or the POTDR method. We explain the ways of the PMD removal at contemporary optic routes and options of PMD compensation by using compensators of various types. There is also mentioned the possibility of profiting from the soliton transmission. The last chapter deals with measuring of a real optic route. It includes measured data and its evaluation due to the ITU-T demands.

My graduation thesis is concerned with the effect of polarization mode dispersion on transmitted signal by optical line. It describes external and internal causes of origination of polarization mode dispersion. On the basis of these effects there is a differential group delay (DGD). It is the time delay in meantime within individual modes. DGD results in a time extension of impulsion and limitation of maximum bit rate. This thesis contains localization methods of part of gossamer filament with increased value of PMD by POTDR method. This method is based on the principium of back dispersion and its modifications SOP a DOP. Very important chapter of this thesis is the measurement of the polarization mode dispersion. There are described methods of PMD measurement. It is the interferometric and polarimetric method and the method of state of polarization. The major part of this thesis is about the reduction of polarization mode dispersion effect. This part is divided into two parts. First part is about the methods of PMD effect reduction and the second one is about the PMD compensation. The discrepancy between these two parts is the reduction way of PMD effect on transmitted channel. The compensation use the compensation components inserted into the transmission path. By PMD reduction methods we can solve the problems from the view of changing of fibre or all cable. For better understanding of polarization mode dispersion effect there are simulated 4 optical lanes of various parameters. The simulation output is the eye diagram which provides the view at results of transmission lane. In the final part there is the evaluation of measured parameters of optical lanes simulated in a laboratory.

This diploma thesis deals with analysis of current diagnostic methods of optical networks, and it is focused on optical fiber dispersion in singlemode fibers. The work starts with a describtion chromatic dispersion and polarization mode dispersion, causes of and thein influence on the transmitted signal at the beginning. There are set out principles and their appropriate use in the list of measuring methods. Furthermore, the work are given the current possibilities for compensation above dispersions. The sixth chapter deals with the measurements and simulations of real routes in the OptiSystem. There are given appropriate compensation methods for the selected route speeds in the last chapter. The simulation is performed for the bit rate 2.5 Gbit / s, 10 Gbit / s and 40 Gbit / s.

Polarization mode dispersion, PMD influence of fibres. Next includes optic dispersion measurement and compensation of optics dispersion follows. In the end thesis analyze measure of existing fibres, simulating and suggest optimal solutions.

This work is focussed on different unwanted effects that damage a digitally acquired image. An image acquired using a digital camera can suffer from a series of defects. First, the noise is concerned. It occures due to discretisation. Next, there are the defects including vignetting, radial image distortion, chromatic aberration. In my thesis I also worked on backlight image compensation and panorama creation from an image sequence. For backlight images we need to increase the brightness in the dark parts of the image, so that the details became more visible. At panorama creation we are careful about brightness evenness in partial images, which is usually not conserved and consequently we try to find a suitable boundary-line to connect images and smooth it. The fundamental part of my work was writing the algorithms that are able to compensate these defects at least partly. For this aim I took use of the Matlab environment.

In space exploration optical imaging is one of the key measurements conducted, with a vast majority of missions heavily relying on optical data acquisition to examine alien worlds. One such endeavor is ESA’s F-class mission Comet Interceptor, a multi-element spacecraft expected to be launched in 2028. It consists of a primary platform and two sub-spacecraft, one of which carrying the Optical Periscopic Imager for Comets (OPIC). An accurate prediction of the generated imagery is of undeniable importance as mission planning and instrument design strongly depend on the real-world output quality of the camera system. In the case of OPIC, the collected image data will be used to reconstruct three dimensional models of targeted celestial bodies. Furthermore, the sub-spacecraft faces a risk of high velocity dust impacts, leading to a limited number of data samples to be broadcasted back to the primary spacecraft before collision. Testing image prioritization algorithms and reconstruction methods prior to mission start requires accurate computer-generated images. Camera sensors and lens systems are subjected to various optical distortions and aberrations that degrade the final image. Popular render engines model those effects to a certain degree only and as a result produce content that is looking too perfect. While more sophisticated software products exist, they often come with compatibility limitations and other drawbacks. This report discusses the most important optical aberrations, as well as their relevance for optical instruments in space applications with a particular focus on the Comet Interceptor mission. The main part of this work is however the implementation of a dedicated software tool that simulates a variety of optical aberrations complementing the basic camera model of the Blender render engine. While its functionality is mostly demonstrated for OPIC, the software is designed with a broad range of usage scenarios in mind.