Cylindrically symmetric shell sources are studied and a general form of induced energy-momentum tensor of a collapsing shell is presented. The actual movement of the shell is numerically solved for a case when dynamics of the system is determined by energy conservation per unit length. It is then shown that additional assumptions can prevent the collapse, e. g. induced energy-momentum tensor as perfect fluid or null dust of counter-rotating particles. Collapse can be prevented also by introducing Thorne's C-energy into the system.

In this thesis I describe the conceptual model of three kinds of instability in terms of precipitation. I describe ways of evaluating their presence in the atmosphere. They are: conditional instability, potential instability and symmetric instability. I have selected three events with strong precipitation in the Czech Republic so that the formation of each of them is with high probability involved in just one of the three kinds of instability. Events are first described using distance and station measurements. Through the NWP model COSMO are created prognostic fields of precipitation and several derived thermodynamic quantities for each event. On the horizontal (for the whole country) and vertical (for selected areas of the Czech Republic) distribution of these variables are demonstrated favourable conditions for the occurrence of the types of instability in the atmosphere. In the event of conditional instability the rainfall occurs in areas with high CAPE and negative or very small positive vertical lapse rate of potential temperature. The event with the potential instability is characterized by the occurrence of negative vertical lapse rate of equivalent potential temperature in the broad layers. The occurrence of symmetric instability suggests a number of indicators. The necessary occurence...

Cette thèse traite de l'étude de méthodes de diagonalisation conjointe de matrices complexes, en vue de la séparation de sources, que ce soit dans le domaine des télécommunications numériques ou de la radioastronomie. Après avoir présenté les motivations qui ont poussé cette étude, nous faisons un bref état de l'art dans le domaine. Le problème de la diagonalisation conjointe, ainsi que celui de la séparation de source sont rappelés, et un lien entre ces deux sujets est établi. Par la suite, plusieurs algorithmes itératifs sont développés. Dans un premier temps, des méthodes utilisant une mise à jour de la matrice de séparation, de type gradient, sont présentées. Elles sont basées sur des approximations judicieuses du critère considéré. Afin d'améliorer la vitesse de convergence, une méthode utilisant un calcul du pas optimal est présentée, et plusieurs variantes de ce calcul, basées sur les approximations faites précédemment, sont développées. Deux autres approches sont ensuite introduites. La première détermine la matrice de séparation de manière analytique, en calculant algébriquement les termes composant la matrice de mise à jour par paire à partir d'un système d'équations linéaire. La deuxième estime récursivement la matrice de mélange, en se basant sur une méthode de moindres carrés alternés. Afin d'améliorer la vitesse de convergence, une recherche de pas d'adaptation linéaire est proposée. Ces méthodes sont alors validées sur un problème de diagonalisation conjointe classique. Puis les algorithmes sont appliqués à la séparation de sources de signaux de télécommunication numérique, en utilisant des statistiques d'ordre deux ou supérieur. Des comparaisons sont également effectuées avec des méthodes standards. La deuxième application concerne l'élimination des interférences terrestres à partir de l'estimation de l'espace associé, afin d'observer au mieux des sources cosmiques, issues de données de station LOFAR. / This thesis deals with the study of joint diagonalization of complex matrices methods for source separation, wether in the field of numerical telecommunications and radioastronomy. After having introduced the motivations that drove this study, we present a brief state-of-the-art in the field. The joint diagonalization and source separation problems are reminded, and a link between these two themes is established. Thereafter, several iterative algorithms are developed. First, methods using a gradient-like update of the separation matrix are introduced. They are based on wise approximations of the considered criterion. In order to improve the convergence speed, a method using a computation of an optimal step size is presented, and variations around this computation, based on the previously introduced approximations are done. Two other approaches are then introduced. The first one analytically determines the separation matrix, by algebraically computing the terms composing the update matrix pairwise from a linear equation system. The second one recursively estimates the mixing matrix, based on an alternating least squares method. In order to enhance the convergence speed, a seek of an enhanced line search algorithm is proposed. These methods are then validated on a classical joint diagonalization problem. Aterwards, these algorithms are applied to the source separation of numerical communication signals, while using second or higher order statistics. Comparisons are also made with well-known methods. The second application relates to elimination of rterrestrial interferences from the estimation of the associated space in order to observe at best cosmic sources from LOFAR station data.

Whereas benchmarking experiments are very frequently used to investigate the performance of statistical or machine learning algorithms for supervised and unsupervised learning tasks, overall analyses of such experiments are typically only carried out on a heuristic basis, if at all. We suggest to determine winners, and more generally, to derive a consensus ranking of the algorithms, as the linear order on the algorithms which minimizes average symmetric distance (Kemeny-Snell distance) to the performance relations on the individual benchmark data sets. This leads to binary programming problems which can typically be solved reasonably efficiently. We apply the approach to a medium-scale benchmarking experiment to assess the performance of Support Vector Machines in regression and classification problems, and compare the obtained consensus ranking with rankings obtained by simple scoring and Bradley-Terry modeling. / Series: Research Report Series / Department of Statistics and Mathematics

While distributed memory systems have shaped the field of distributed systems for decades, the demand for many-core shared memory resources is increasing. Symmetric Multiprocessor Systems (SMPs) have become increasingly important recently among a wide array of disciplines, ranging from Bioinformatics to astrophysics, and beyond. With the increase in big data computing, the size and scope of traditional commodity server systems is often outpaced. While some big data applications can be mapped to distributed memory systems found through many cluster and cloud technologies today, this effort represents a large barrier of entry that some projects cannot cross. Shared memory SMP systems look to effectively and efficiently fill this niche within distributed systems by providing high throughput and performance with minimized development effort, as the computing environment often represents what many researchers are already familiar with. In this paper, we look at the use of two common shared memory systems, the ScaleMP vSMP virtualized SMP deployment at Indiana University, and the SGI UV architecture deployed at University of Arizona. While both systems are notably different in their design, their potential impact on computing is remarkably similar. As such, we look to compare each system first under a set of OpenMP threaded benchmarks via the SPEC group, and to follow up with our experience using each machine for Trinity de-novo assembly. We find both SMP systems are well suited to support various big data applications, with the newer vSMP deployment often slightly faster; however, certain caveats and performance considerations are necessary when considering such SMP systems.

[pt] A tese Filtros ótimos que conservam qualquer ordem de tendência aborda os fundamentos dos filtros simétricos de Henderson que estão inseridos no contexto de ajuste sazonal, mais especificamente nos métodos da família X11; desenvolve um filtro ótimo, baseado em técnicas do domínio da freqüência, utilizando hipóteses mais amplas que os filtros de Henderson; compara a performance dos dois filtros e propõe um método de ajuste sazonal baseado no filtro ótimo. / [en] The thesis Filtros ótimos que conservam qualquer ordem de tendência (Optimal Filters that Preserve Trend of Any Order), investigates the principles of the Henderson symmetric filters, which are inserted in the context of seasonal adjustment, specifically in the methods of the X11 family; it also develops optimal filters, based on techniques in the Frequency domain, using more general hypothesis than the ones for the Henderson filters; and compares the performance of the both filters and suggests a method of seasonal adjustment based on the optimal filter.

Technological development has significantly reduced the distance between the performance of systems designed using reconfigurable computing and dedicated hardware. The main sources of performance are the high density level of the FPGAs and the resources? improvement offered by manufacturers, who make more its use more attractive in a variety of applications, emphatically in systems that demand a high degree of flexibility. In this context, the objective of this work consists on the exploration of the resources offered by FPGAs for the development of a multiprocessed platform with the purpose of parallel execution of tasks. In this way, the eCos operating system was modified, with the addition of new characteristics to support of the Symmetric Multiprocessing model, using three soft-Core Altera Nios II processors. On this operating system, all parallelism is directly related to execution of the threads. This platform was analyzed and validated through the execution of parallel algorithms, emphasizing aspects of performance and flexibility compared to other architectures. This work contributes for reaching better results in the execution of tasks in robotics area, which belongs to a domain that demand great competition of tasks, mainly in modules that involve interaction with the external environment / Technological development has significantly reduced the distance between the performance of systems designed using reconfigurable computing and dedicated hardware. The main sources of performance are the high density level of the FPGAs and the resources? improvement offered by manufacturers, who make more its use more attractive in a variety of applications, emphatically in systems that demand a high degree of flexibility. In this context, the objective of this work consists on the exploration of the resources offered by FPGAs for the development of a multiprocessed platform with the purpose of parallel execution of tasks. In this way, the eCos operating system was modified, with the addition of new characteristics to support of the Symmetric Multiprocessing model, using three soft-Core Altera Nios II processors. On this operating system, all parallelism is directly related to execution of the threads. This platform was analyzed and validated through the execution of parallel algorithms, emphasizing aspects of performance and flexibility compared to other architectures. This work contributes for reaching better results in the execution of tasks in robotics area, which belongs to a domain that demand great competition of tasks, mainly in modules that involve interaction with the external environment

Cordeiro e Andrade (2009) incorporam a ideia de variável resposta transformada ao modelo GARMA, autorregressivo e de médias móveis generalizado, introduzido por Benjamin et al. (2003), desenvolvendo assim, o modelo TGARMA, autorregressivo e de médias móveis generalizado transformado. O objetivo do presente trabalho é desenvolver o modelo TGARMA introduzido por Cordeiro e Andrade (2009) para distribuições condicionais simétricas contínuas com e sem heteroscedasticidade e uma possível função não linear para os parâmetros de regressão. Ao longo desta tese derivamos um processo iterativo para estimar os parâmetros desses modelos por máxima verossimilhança. Nós produzimos uma fórmula simples para estimar o parâmetro que define a transformação da variável resposta para uma subclasse de modelos. Fornecemos os momentos para a variável dependente original. Para o modelo homoscedástico, discutimos inferência de alguns parâmetros, propomos uma análise de diagnóstico e a definição de um resíduo padronizado. Finalmente, para ilustrar a teoria desenvolvida, tanto no caso homoscedástico quanto no caso heteroscedástico, utilizamos conjuntos de dados reais e avaliamos os resultados desenvolvidos por meio de estudos de simulação. / Cordeiro and Andrade (2009) incorporate the idea of transforming the response variable to the GARMA model, generalized autoregressive moving average, introduced by Benjamin et al. (2003), thus developing the TGARMA model, transformed generalized autoregressive moving average. The goal of this thesis is to develop the TGARMA model introduced by Cordeiro and Andrade (2009) for symmetric continuous conditional distributions and a possible non-linear structure for the mean that enables the fitting of a wide range of models to several data types. When the assumption of homoscedasticity is not verified, heteroscedastic models are proposed. Throughout this thesis, we derive an iterative process for fitting the parameters of the models by maximum likelihood. We produce a simple formula to estimate the parameter which defines the transformation of the response variable and the moments of the original dependent variable which generalize previous published results. For the homoscedastic model, we discuss inference, we propose a diagnostic analysis and define a standardized residuals. Finally, to illustrate the theory developed, we use real data sets and we evaluate the results developed through simulations studies.

x, 81 p. : ill. A print copy of this thesis is available through the UO Libraries. Search the library catalog for the location and call number. / We give an exposition of Deligne's tensor category Rep(St) where t is not necessarily an integer. Thereafter, we give a complete description of the blocks in Rep(St) for arbitrary t. Finally, we use our result on blocks to decompose tensor products and classify tensor ideals in Rep(St). / Committee in charge: Victor Ostrik, Chairperson, Mathematics; Daniel Dugger, Member, Mathematics; Jonathan Brundan, Member, Mathematics; Alexander Kleshchev, Member, Mathematics; Michael Kellman, Outside Member, Chemistry

In the 1980s and 1990s, Joyal and Street developed a graphical notation for various flavours of monoidal category using graphs drawn in the plane, commonly known as string diagrams. In particular, their work comprised a rigorous topological foundation of the notation. In 2007, Harmer, Hyland and Melliès gave a formal mathematical foundation for game semantics using a notions they called ⊸-schedules, ⊗-schedules and heaps. Schedules described interleavings of plays in games formed using ⊸ and ⊗, and heaps provided pointers used for backtracking. Their definitions were combinatorial in nature, but researchers often draw certain pictures when working in practice. In this thesis, we extend the framework of Joyal and Street to give a formal account of the graphical methods already informally employed by researchers in game semantics. We give a geometric formulation of ⊸-schedules and ⊗-schedules, and prove that the games they describe are isomorphic to those described in Harmer et al.’s terms, and also those given by a more general graphical representation of interleaving across games of multiple components. We further illustrate the value of the geometric methods by demonstrating that several proofs of key properties (such as that the composition of ⊸-schedules is associative) can be made straightforward, reflecting the geometry of the plane, and overstepping some of the cumbersome combinatorial detail of proofs in Harmer et al.’s terms. We further extend the framework of formal plane diagrams to account for the heaps and pointer structures used in the backtracking functors for O and P.