Les systèmes à commutations constituent un cas particulier des systèmes dynamiques hybrides. Ils sont composés d'une famille de systèmes et d'une loi de commutation qui détermine quel mode est activé à chaque instant. Ces systèmes représentent une large gamme de systèmes concrets. L'étude de la stabilité de ceux-ci a déjà été longuement abordée. Les travaux de cette thèse portent sur l'analyse de performance des systèmes à commutations linéaires en temps discret et sur la synthèse de différentes lois de commande pour ces systèmes en tenant compte de contraintes de performances. L'analyse de stabilité de ces systèmes a été étendue pour tenir compte de l'aspect performance qui a été modélisée par un critère quadratique. La valeur du critère dépendant des commutations, l'analyse porte sur le coût garanti des performances. Grâce à la résolution d'un problème d'optimisation sous des contraintes sous la forme d'inégalités matricielles linéaires, un majorant du coût garanti est déterminé. Une approche est proposée pour évaluer la qualité du majorant trouvé. Un deuxième point abordé est la conception de contrôleurs qui tiennent compte de l'aspect performance. Des méthodes de synthèse de différents contrôleurs (retour d'état, retour d'état reconstruit par observateur et retour de sortie dynamique) sont proposées dans ce cadre. Enfin, nos résultats ont été appliqués au cas des systèmes contrôlés en réseau. / Switched systems are a specific case of dynamical hybrid systems. They are made up of a family of subsystems and of a switching law which defines the activated subsystem at each instant. These systems depict a wide range of real systems. Stability's study has been intensely studied. This Ph.D. thesis deals with performance analysis for discrete-time switched linear systems and synthesis of different control laws by taking into account performance constraints. Stability's analysis for these systems was spread in order to taking into account performance aspect, modeled by a quadratic criterion. As the value of the criterion depends on commutations, the analysis is done for the guaranteed cost of performances. By solving an optimization problem under constraints in the form of linear matrices inequalities, an upper bound of the guaranteed cost is found. An approach is proposed to certificate the upper bound. An other tackled point is the synthesis of controllers which take into account performance aspect. Methods of synthesis of different controllers (state feedback, state feedback based on observer and dynamic output feedback) are proposed. Last, our results are applied to networked controlled systems

Les machines du domaine du calcul haute performance (HPC) gagnent régulièrement en com- plexité. De nos jours, chaque nœud de calcul peut être constitué de plusieurs puces ou de plusieurs cœurs se partageant divers caches mémoire de façon hiérarchique. Que se soit pour comprendre les performances ob- tenues par une application sur ces architectures ou pour développer de nouveaux algorithmes et valider leur performance, une phase d'expérimentation est souvent nécessaire. Dans cette thèse, nous nous intéressons à deux formes d'analyse expérimentale : l'exécution sur machines réelles et la simulation d'algorithmes sur des jeux de données aléatoires. Dans un cas comme dans l'autre, le contrôle des paramètres de l'environnement (matériel ou données en entrée) permet une meilleure analyse des performances de l'application étudiée. Ainsi, nous proposons deux méthodes pour contrôler l'utilisation par une application des ressources ma- térielles d'une machine : l'une pour le temps processeur alloué et l'autre pour la quantité de cache mémoire disponible. Ces deux méthodes nous permettent notamment d'étudier les changements de comportement d'une application en fonction de la quantité de ressources allouées. Basées sur une modification du compor- tement du système d'exploitation, nous avons implémenté ces méthodes pour un système Linux et démontré leur utilité dans l'analyse de plusieurs applications parallèles. Du point de vue de la simulation, nous avons étudié le problème de la génération aléatoire de graphes orientés acycliques (DAG) pour la simulation d'algorithmes d'ordonnancement. Bien qu'un grand nombre d'algorithmes de génération existent dans ce domaine, la plupart des publications repose sur des implémen- tations ad-hoc et peu validées de ces derniers. Pour pallier ce problème, nous proposons un environnement de génération comprenant la majorité des méthodes rencontrées dans la littérature. Pour valider cet envi- ronnement, nous avons réalisé de grande campagnes d'analyses à l'aide de Grid'5000, notamment du point de vue des propriétés statistiques connues de certaines méthodes. Nous montrons aussi que la performance d'un algorithme est fortement influencée par la méthode de génération des entrées choisie, au point de ren- contrer des phénomènes d'inversion : un changement d'algorithme de génération inverse le résultat d'une comparaison entre deux ordonnanceurs. / High performance computing systems are increasingly complex. Nowadays, each compute node can contain several sockets or several cores and share multiple memory caches in a hierarchical way. To understand an application's performance on such systems or to develop new algorithms and validate their behavior, an experimental study is often required. In this thesis, we consider two types of experimental analysis : execution on real systems and simulation using randomly generated inputs. In both cases, a scientist can improve the quality of its performance analysis by controlling the environment (hardware or input data) used. Therefore, we discuss two methods to control hardware resources allocation inside a system : one for the processing time given to an application, the other for the amount of cache memory available to it. Both methods allow us to study how an application's behavior change according to the amount of resources allocated. Based on modifications of the operating system, we implemented these methods for Linux and demonstrated their use for the analysis of several parallel applications. Regarding simulation, we studied the issue of the random generation of directed acyclic graphs for scheduler simulations. While numerous algorithms can be found for such problem, most papers in this field rely on ad-hoc implementations and provide little validation of their generator. To tackle this issue, we propose a complete environment providing most of the classical generation methods. We validated this environment using big analysis campaigns on Grid'5000, verifying known statistical properties of most algorithms. We also demonstrated that the performance of a scheduler can be impacted by the generation method used, identifying a reversing phenomenon : changing the generating algorithm can reverse the comparison between two schedulers.

Submitted by Joana Azevedo (joanad@id.uff.br) on 2017-07-03T14:55:40Z No. of bitstreams: 1 Dissert JOSÉ AUGUSTO ROCHA.pdf: 1996024 bytes, checksum: 0cfc2db29c90df8ace21fe9118c5baf0 (MD5) / Approved for entry into archive by Biblioteca da Escola de Engenharia (bee@ndc.uff.br) on 2017-07-10T14:52:24Z (GMT) No. of bitstreams: 1 Dissert JOSÉ AUGUSTO ROCHA.pdf: 1996024 bytes, checksum: 0cfc2db29c90df8ace21fe9118c5baf0 (MD5) / Made available in DSpace on 2017-07-10T14:52:24Z (GMT). No. of bitstreams: 1 Dissert JOSÉ AUGUSTO ROCHA.pdf: 1996024 bytes, checksum: 0cfc2db29c90df8ace21fe9118c5baf0 (MD5) Previous issue date: 2013-08-23 / A Tecnologia da Informação e Comunicação (TIC) tem modificado o relacionamento entre empresas, governo e sociedade civil e a adoção de práticas de governança e gerenciamento de serviços de TIC vem sendo, cada vez mais, utilizadas em busca do alinhamento com as estratégias de negócio, seja no setor público ou privado. No contexto da operação de serviços de TIC, uma Central de Serviços (Service Desk) é uma unidade funcional de vital importância, responsável por lidar com uma ampla variedade de demandas e deve ser o único ponto de contato para os usuários de TIC, tratando de todos os incidentes e requisições de serviço. Esta pesquisa apresenta como principal foco a necessidade de identificação da percepção dos níveis de exigências dos usuários internos quanto à importância e desempenho do Service Desk. A Análise Importância-Desempenho revelou ser uma técnica simples e de bastante utilidade, facilitando a análise dos resultados. Utilizando declarações do modelo SERVQUAL adaptadas para o presente estudo e, utilizando um questionário eletrônico, 130 usuários (40 da área finalística, 68 da área de gestão e 22 do staff da presidência) responderam a pesquisa. Os resultados finais revelaram que existe uma pequena diferença na percepção dos usuários (entre as áreas) e que todos os critérios de qualidade foram considerados como de moderada à grande importância, com a particularidade de que o desempenho ficou ligeiramente abaixo da importância, revelando necessidade de ações para promover melhoria da qualidade de serviços. / The Information Technology and Communication (ICT) area has changed the relationship between business, government and civil society. The adoption of corporate governance practices and management of ICT services has been used in pursuit of the alignment with business strategies, both in public and private sectors. In the context of the operation of ICT services, the Service Desk is a functional unit of vital importance, responsible for dealing with a variety of events and services and should be the single point of contact for ICT users, dealing with all incidents and service requests. This study presents as its main focus the need to survey the perception of the requirement levels of internal users on the importance and performance of the Service Desk. The Importance-Performance Analysis showed that the technique is simple and very useful, facilitating the analysis of the results. Using SERVQUAL statements adapted for this study, and an electronic questionnaire, 130 users (68 from technical area, 40 from management and 22 from presidency staff) responded to the survey. The final results revealed that there is little difference in users' perception and revealed that all quality criteria were considered moderate to high importance with the peculiarity that the performance was slightly below the importance, revealing the need for actions to promote improved quality of services.

Neste trabalho são propostos: a elaboração e a validação de um modelo técnico-tático de combate no judô e para caracterização dos atletas olímpicos de 2012 em competições do circuito mundial e nos Jogos Olímpicos de Londres. Para isso, a amostra foi composta por 1.411 performances em combates olímpicos e ranqueadores de atletas participantes dos Jogos Olímpicos de Londres (sete categorias de peso no masculino e feminino). A análise foi realizada pelo programa FRAMI® observando as fases do combate (aproximação, pegada, situação ataque/defesa, luta de solo e pausa), a partir das variáveis: i) tipos de aproximação; ii) configurações de pegada; iii) execução e orientação de golpes; iv) tipo de defesa; v) caracterização da luta de solo e vi) pontuação por punições e projeções. Para verificar a correlação entre as análises repetidas inter e intra-expert foi utilizado o Coeficiente Cohen s Kappa. Os modelos de probabilidade de combinação entre fases do combate foram feitos através de Processos de Markov. Para comparar as diferenças entre resultados, categorias de peso e combatesclassificatório e olímpico, utilizou-se análise de variância, seguida de post hoc, com p < 0,05 para todas as análises. Os resultados da validação revelaram índice de concordância para análise das fases e ações do combate, respectivamente de 0,94 e 0,91, classificadas como quase perfeita para as medidas de um mesmo avaliador e 0,72 e 0,73, classificadas como forte para as comparações entre diferentes observadores. Em relação ao modelo por processos markovianos da sequência de fases dos combates, foram encontradas fortes probabilidades de combinação das fases utilizadas no modelo de combate, sem efeitos de categoria de peso, resultado e nível competitivo para o modelo de probabilidade. As comparações revelaram que categorias mais pesadas apresentam menor número de ataques e projeções, com tempos mais prolongados de pegada e combate do que as categorias mais Leves durante os Jogos Olímpicos. No feminino, as atletas do Meio-leve apresentaram maior frequência de pegada em uma das mangas, menor número de projeções e tempos maiores de combate, aproximação e pegada quando comparada às outras categorias. Em relação à diferença entre níveis, os tempos de ações no combate em pé (fase de aproximação, pegada, ataque e defesa) dos Jogos Olímpicos foram significativamente maiores quando comparados ao circuito internacional. Por sua vez, os dados demonstram que atletas vitoriosos realizam maior número de ataques e projeções com técnicas de Alavanca Braço e Pé e defesas em esquivas para esquerda e para direita. Lutadores de categorias mais Leves demonstraram maior frequência de ataques com Alavanca Váriavel na Altura da Cintura e do Maléolo em comparação com a categoria Pesado. Ademais, a quantidade de punições aumentou significativamente conforme a categoria e o nível competitivo o que refletiu em diferenças entre ganhadores e perdedores, ou seja, atletas vitoriosos conquistaram maior número de pontos por punição que atletas com derrotas, tanto para homens quanto para mulheres / This work proposed developing and validating a technical-tactical model for judo combat, characterizing Olympic athletes in the 2012 international circuit and London Olympic Games. For this purpose, the sample was composed of 1.411 combat performances in the ranking system World Championships and London Olympic Games participants (seven weight categories, male and female). The analysis was performed with the aid of FRAMI-software® observing the combat phases (approximation, gripping, attack/defense situation, groundwork combat and pause), based on the following variables: i) types of approach, ii) gripping configurations, iii) execution and orientation of attacks iv) type of defense v) characterization of groundwork combat and vi) score by punishments and projections. In order to verify the correlation between inter-and intra-expert analyses, the Cohen\'s Kappa coefficient was used. The probability models for combinations between combat phases were made using Markov Processes. In order to compare differences in the results, weight categories and qualifying and Olympic combats, variance analysis was used, followed by a post hoc, p <0.05 for all analyses. The validation results showed concordance indexes for analysis of the phases and actions of combat of 0.94 and 0.91 respectively, classified as \"almost perfect\" for intra-expert measures, and 0.72 and 0.73, classified as \"strong\", for comparisons between different observers. Regarding the Markov processes model, a strong probability was observed between sequential phases, without effects between weight category, results and competitive Level. The comparisons revealed that heavier categories have fewer attacks and projections than others, with longer combat and gripping times than lighter weight classes during the Olympics. In females, the Middleweight mean division had a higher frequency of sleeve gripping type, fewer projections and longer combat, approach and gripping times than other categories. Regarding the difference between championship Levels, stand combat time (approach, gripping, attack and defense) in Olympics were significantly higher when compared to the international circuit. In turn, the data show that victorious athletes perform more attacks and projections with Arm and Leg Lever and defenses with left and right escapes. Athletes in the lighter weight classes showed higher frequency of attacks, which were classified as Variable Waist Lever and Variable Malleolus Lever compared with the Heavy category. Moreover, the amount of punishment increased significantly according to the category and competitive Level, which resulted in differences between winners and losers; i.e., victorious athletes won most scores by punishing athletes in male and female combats

Les systèmes distribués, tels que les grilles, sont utilisés aujourd’hui pour l’exécution des grandes applications parallèles. Quelques caractéristiques de ces systèmes sont l’interconnexion complexe de ressources qui pourraient être présent et de la facile passage à l’échelle. La complexité d’interconnexion vient, par exemple, d’un nombre plus grand de directives de routage pour la communication entre les processus et une latence variable dans le temps. La passage à l’échelle signifie que des ressources peuvent être ajoutées indéfiniment simplement en les reliant à l’infrastructure existante. Ces caractéristiques influencent directement la façon dont la performance des applications parallèles doit être analysée. Les techniques de visualisation traditionnelles pour cette analyse sont généralement basées sur des diagrammes de Gantt que disposent la liste des composants de l’application verticalement et metent la ligne du temps sur l’axe horizontal. Ces représentations visuelles ne sont généralement pas adaptés à l’analyse des applications exécutées en parallèle dans les grilles. La première raison est qu’elles n’ont pas été conçues pour offrir aux développeurs une analyse qui montre aussi la topologie du réseau des ressources. La deuxième raison est que les techniques de visualisation traditionnels ne s’adaptent pas bien quand des milliers d’entités doivent être analysés ensemble. Cette thèse tente de résoudre les problèmes des techniques traditionnelles dans la visualisation des applications parallèles. L’idée principale est d’exploiter le domaine de la visualisation de l’information et essayer d’appliquer ses concepts dans le cadre de l’analyse des programmes parallèles. Portant de cette idée, la thèse propose deux modèles de visualisation : les trois dimensions et le modèle d’agrégation visuelle. Le premier peut être utilisé pour analyser les programmes parallèles en tenant compte de la topologie du réseau. L’affichage lui-même se compose de trois dimensions, où deux sont utilisés pour indiquer la topologie et la troisième est utilisée pour représenter le temps. Le second modèle peut être utilisé pour analyser des applications parallèles comportant un très grand nombre de processsus. Ce deuxième modèle exploite une organisation hiérarchique des données utilisée par une technique appelée Treemap pour représenter visuellement la hiérarchie. Les implications de cette thèse sont directement liées à l’analyse et la compréhension des applications parallèles exécutés dans les systèmes distribués. Elle améliore la compréhension des modes de communication entre les processus et améliore la possibilité d’assortir les motifs avec cette topologie de réseau réel sur des grilles. Bien que nous utilisons abondamment l’exemple de la topologie du réseau, l’approche pourrait être adapté, avec presque pas de changements, à l’interconnexion fourni par un middleware d’une interconnexion logique. Avec la technique d’agrégation, les développeurs sont en mesure de rechercher des patterns et d’observer le comportement des applications à grande échelle. / Sistemas distribuídos tais como grids são usados hoje para a execução de aplicações paralelas com um grande número de processos. Algumas características desses sistemas são a presença de uma complexa rede de interconexão e a escalabilidade de recursos. A complexidade de rede vem, por exemplo, de largura de banda e latências variáveis ao longo do tempo. Escalabilidade é a característica pela qual novos recursos podem ser adicionados em um grid apenas através da conexão em uma infraestrutura pré-existente. Estas características influenciam a forma como o desempenho de aplicações paralelas deve ser analisado. Esquemas tradicionais de visualização de desempenho são usualmente baseados em gráficos Gantt com uma dimensão para listar entidades monitoradas e outra para o tempo. Visualizações como essa não são apropriadas para a análise de aplicações paralelas executadas em grid. A primeira razão para tal é que elas não foram concebidas para oferecer ao desenvolvedor uma análise que mostra a topologia dos recursos e a relação disso com a aplicação. A segunda razão é que técnicas tradicionais não são escaláveis quando milhares de entidades monitoradas devem ser analisadas conjuntamente. Esta tese tenta resolver estes problemas encontrados em técnicas de visualização tradicionais para a análise de aplicações paralelas. A idéia principal consiste em explorar técnicas da área de visualização da informação e aplicá-las no contexto de análise de programas paralelos. Levando em conta isto, esta tese propõe dois modelos de visualização: o de três dimensões e o modelo de agregação visual. O primeiro pode ser utilizado para analisar aplicações levando-se em conta a topologia da rede dos recursos. A visualização em si é composta por três dimensões, onde duas são usadas para mostrar a topologia e a terceira é usada para representar o tempo. O segundo modelo pode ser usado para analisar aplicações paralelas com uma grande quantidade de processos. Ela explora uma organização hierárquica dos dados de monitoramento e uma técnica de visualização chamada Treemap para representar visualmente a hierarquia. Os dois modelos representam uma nova forma de analisar aplicação paralelas visualmente, uma vez que eles foram concebidos para larga-escala e sistemas distribuídos complexos, como grids. As implicações desta tese estão diretamente relacionadas à análise e ao entendimento do comportamento de aplicações paralelas executadas em sistemas distribuídos. Um dos modelos de visualização apresentados aumenta a compreensão dos padrões de comunicação entre processos e oferece a possibilidade de observar tal padrão com a topologia de rede. Embora a topologia de rede seja usada, a abordagem pode ser adaptada sem grandes mudanças para levar em conta interconexões lógicas de bibliotecas de comunicação. Com a técnica de agregação apresentada nesta tese, os desenvolvedores são capazes de observar padrões de aplicações paralelas de larga escala. / Highly distributed systems such as grids are used today for the execution of large-scale parallel applications. Some characteristics of these systems are the complex resource interconnection that might be present and the scalability. The interconnection complexity comes from the different number of hops to provide communication among applications processes and differences in network latencies and bandwidth. The scalability means that the resources can be added indefinitely just by connecting them to the existing infrastructure. These characteristics influence directly the way parallel applications performance must be analyzed. Current traditional visualization schemes to this analysis are usually based on Gantt charts with one dimension to list the monitored entities and the other dimension dedicated to time. These visualizations are generally not suited to parallel applications executed in grids. The first reason is that they were not built to offer to the developer an analysis that also shows the network topology of the resources. The second reason is that traditional visualization techniques do not scale well when thousands of monitored entities must be analyzed together. This thesis tries to overcome the issues encountered on traditional visualization techniques for parallel applications. The main idea behind our efforts is to explore techniques from the information visualization research area and to apply them in the context of parallel applications analysis. Based on this main idea, the thesis proposes two visualization models: the three-dimensional and the visual aggregation model. The former might be used to analyze parallel applications taking into account the network topology of the resources. The visualization itself is composed of three dimensions, where two of them are used to render the topology and the third is used to represent time. The later model can be used to analyze parallel applications composed of several thousands of processes. It uses hierarchical organization of monitoring data and an information visualization technique called Treemap to represent that hierarchy. Both models represent a novel way to visualize the behavior of parallel applications, since they are conceived considering large-scale and complex distributed systems, such as grids. The implications of this thesis are directly related to the analysis and understanding of parallel applications executed in distributed systems. It enhances the comprehension of patterns in communication among processes and improves the possibility of matching this patterns with real network topology of grids. Although we extensively use the network topology example, the approach could be adapted with almost no changes to the interconnection provided by a middleware of a logical interconnection. With the scalable visualization technique, developers are able to look for patterns and observe the behavior of large-scale applications.

O objetivo deste trabalho é modelar a arquitetura de uma usina solar fotovoltaica arrefecida intitulada UFVa, utilizando um protótipo de verificação. A metodologia se baseia na medição, verificação e análise dos dados de temperatura e produção de energia elétrica dos strings de teste (arrefecido) e comparação (não arrefecido), estudo do comportamento da alimentação de água do sistema de arrefecimento e o impacto das condições climáticas na operação do protótipo de UFVa. Por meio das análises dos dados constatou-se que, para o período entre as 09h00min e as 17h30min, os módulos PV do string de teste sempre operam com temperaturas inferiores aos módulos PV do string de comparação. Durante o período de testes, no qual a temperatura dos módulos PV do string de comparação operou acima de 55,0°C, as temperaturas médias e máximas registradas nos módulos PV do string de teste foram inferiores a 37,0 °C, operando sempre abaixo da temperatura nominal de operação da célula (NOCT). A produção de energia elétrica no string de teste superou a do string de comparação em 3,0kWh/dia. Portanto, o sistema de arrefecimento reduz a temperatura de operação dos módulos PV, principalmente no período de máxima geração elétrica, que corresponde ao período das 11h00min às 15h00min, proporcionando ganhos médios de rendimento de 5,9% na produção de energia, 10,3% na potência e 5,4% no FC. / In this work we use a verification prototype to model the architecture of a solar photovoltaic power plant equipped with a cooling system. The power plant we model is called UFVa. The methodology is based on the measurement, verification, and data analysis of temperature, electricity generation, test strings (cooled) and comparison strings (not cooled), along with a study of the water feeding behavior of the cooling system, and the impact of climatic conditions in the UFVa prototype operation. By analyzing the data we observed that, for the period between 09:00am and 5:30pm, the PV modules of the test string operate at temperatures below those of the PV modules of the comparison string. During the tests, in which the temperature of the PV modules of the comparison string operated above 55.0°C, the average and the maximum temperatures recorded in the PV modules of the testing string lied below 37.0°C, operating below the NOCT. Regarding the generation of electricity, the test string generated 3.0 kWh/day more than the comparison string. Hence, the cooling system decreases the operating temperature of the PV modules, particularly during the maximum power generation period which is from 11am to 3pm. This leads to efficiency average gains of up to 5.9% in the generation of electricity, 10.3% in the power, and 5.3% in the PR and PF.

Neste trabalho são propostos: a elaboração e a validação de um modelo técnico-tático de combate no judô e para caracterização dos atletas olímpicos de 2012 em competições do circuito mundial e nos Jogos Olímpicos de Londres. Para isso, a amostra foi composta por 1.411 performances em combates olímpicos e ranqueadores de atletas participantes dos Jogos Olímpicos de Londres (sete categorias de peso no masculino e feminino). A análise foi realizada pelo programa FRAMI® observando as fases do combate (aproximação, pegada, situação ataque/defesa, luta de solo e pausa), a partir das variáveis: i) tipos de aproximação; ii) configurações de pegada; iii) execução e orientação de golpes; iv) tipo de defesa; v) caracterização da luta de solo e vi) pontuação por punições e projeções. Para verificar a correlação entre as análises repetidas inter e intra-expert foi utilizado o Coeficiente Cohen s Kappa. Os modelos de probabilidade de combinação entre fases do combate foram feitos através de Processos de Markov. Para comparar as diferenças entre resultados, categorias de peso e combatesclassificatório e olímpico, utilizou-se análise de variância, seguida de post hoc, com p < 0,05 para todas as análises. Os resultados da validação revelaram índice de concordância para análise das fases e ações do combate, respectivamente de 0,94 e 0,91, classificadas como quase perfeita para as medidas de um mesmo avaliador e 0,72 e 0,73, classificadas como forte para as comparações entre diferentes observadores. Em relação ao modelo por processos markovianos da sequência de fases dos combates, foram encontradas fortes probabilidades de combinação das fases utilizadas no modelo de combate, sem efeitos de categoria de peso, resultado e nível competitivo para o modelo de probabilidade. As comparações revelaram que categorias mais pesadas apresentam menor número de ataques e projeções, com tempos mais prolongados de pegada e combate do que as categorias mais Leves durante os Jogos Olímpicos. No feminino, as atletas do Meio-leve apresentaram maior frequência de pegada em uma das mangas, menor número de projeções e tempos maiores de combate, aproximação e pegada quando comparada às outras categorias. Em relação à diferença entre níveis, os tempos de ações no combate em pé (fase de aproximação, pegada, ataque e defesa) dos Jogos Olímpicos foram significativamente maiores quando comparados ao circuito internacional. Por sua vez, os dados demonstram que atletas vitoriosos realizam maior número de ataques e projeções com técnicas de Alavanca Braço e Pé e defesas em esquivas para esquerda e para direita. Lutadores de categorias mais Leves demonstraram maior frequência de ataques com Alavanca Váriavel na Altura da Cintura e do Maléolo em comparação com a categoria Pesado. Ademais, a quantidade de punições aumentou significativamente conforme a categoria e o nível competitivo o que refletiu em diferenças entre ganhadores e perdedores, ou seja, atletas vitoriosos conquistaram maior número de pontos por punição que atletas com derrotas, tanto para homens quanto para mulheres / This work proposed developing and validating a technical-tactical model for judo combat, characterizing Olympic athletes in the 2012 international circuit and London Olympic Games. For this purpose, the sample was composed of 1.411 combat performances in the ranking system World Championships and London Olympic Games participants (seven weight categories, male and female). The analysis was performed with the aid of FRAMI-software® observing the combat phases (approximation, gripping, attack/defense situation, groundwork combat and pause), based on the following variables: i) types of approach, ii) gripping configurations, iii) execution and orientation of attacks iv) type of defense v) characterization of groundwork combat and vi) score by punishments and projections. In order to verify the correlation between inter-and intra-expert analyses, the Cohen\'s Kappa coefficient was used. The probability models for combinations between combat phases were made using Markov Processes. In order to compare differences in the results, weight categories and qualifying and Olympic combats, variance analysis was used, followed by a post hoc, p <0.05 for all analyses. The validation results showed concordance indexes for analysis of the phases and actions of combat of 0.94 and 0.91 respectively, classified as \"almost perfect\" for intra-expert measures, and 0.72 and 0.73, classified as \"strong\", for comparisons between different observers. Regarding the Markov processes model, a strong probability was observed between sequential phases, without effects between weight category, results and competitive Level. The comparisons revealed that heavier categories have fewer attacks and projections than others, with longer combat and gripping times than lighter weight classes during the Olympics. In females, the Middleweight mean division had a higher frequency of sleeve gripping type, fewer projections and longer combat, approach and gripping times than other categories. Regarding the difference between championship Levels, stand combat time (approach, gripping, attack and defense) in Olympics were significantly higher when compared to the international circuit. In turn, the data show that victorious athletes perform more attacks and projections with Arm and Leg Lever and defenses with left and right escapes. Athletes in the lighter weight classes showed higher frequency of attacks, which were classified as Variable Waist Lever and Variable Malleolus Lever compared with the Heavy category. Moreover, the amount of punishment increased significantly according to the category and competitive Level, which resulted in differences between winners and losers; i.e., victorious athletes won most scores by punishing athletes in male and female combats

Advanced mobile communication systems are characterized by a dense deployment of different types of wireless access points. Since these systems are primarily limited by interference, multiple-input multiple-output (MIMO) techniques as well as coordinated transmission and detection schemes are necessary to mitigate this limitation. Thus, mobile communication systems become more complex which requires that also the mathematical tools for their theoretical analysis must evolve. These must be able to take the most important system characteristics into account, such as fading, path loss, and interference. The aim of this thesis is to develop such tools based on large random matrix theory and to demonstrate their usefulness with the help of several practical applications, such as the performance analysis of network MIMO and large-scale MIMO systems, the design of low-complexity polynomial expansion detectors, and the study of random beamforming techniques as well as multi-hop relay and double-scattering channels. The methods developed in this work provide deterministic approximations of the system performance which become arbitrarily tight in the large system regime with an unlimited number of transmitting and receiving devices. This leads in many cases to simple and close approximations of the finite-size system performance and allows one to draw relevant conclusions about the most significant parameters. One can think of these methods as a way to provide a deterministic abstraction of the physical layer which substantially reduces the system complexity. Due to this complexity reduction, it is possible to carry out a system optimization which would be otherwise intractable.

Die Dissertation behandelt methodische und algorithmische Aspekte der Spektralelementemethode zur räumlichen Diskretisierung partieller Differentialgleichungen. Die Weiterentwicklung einer symmetriebasierten Faktorisierung ermöglicht effiziente Operatoren für Tetraederelemente. Auf Grundlage einer umfassenden Leistungsanalyse werden Engpässe in der Implementierung der Operatoren identifiziert und durch algorithmische Modifikationen der Methode eliminiert.

This thesis presents how performance data from hardware accelerators can be included in event logs. It extends the capabilities of trace-based performance analysis to also monitor and record data from this novel parallelization layer. The increasing awareness to power consumption of computing devices has led to an interest in hybrid computing architectures as well. High-end computers, workstations, and mobile devices start to employ hardware accelerators to offload computationally intense and parallel tasks, while at the same time retaining a highly efficient scalar compute unit for non-parallel tasks. This execution pattern is typically asynchronous so that the scalar unit can resume other work while the hardware accelerator is busy. Performance analysis tools provided by the hardware accelerator vendors cover the situation of one host using one device very well. Yet, they do not address the needs of the high performance computing community. This thesis investigates ways to extend existing methods for recording events from highly parallel applications to also cover scenarios in which hardware accelerators aid these applications. After introducing a generic approach that is suitable for any API based acceleration paradigm, the thesis derives a suggestion for a generic performance API for hardware accelerators and its implementation with NVIDIA CUPTI. In a next step the visualization of event logs containing data from execution streams on different levels of parallelism is discussed. In order to overcome the limitations of classic performance profiles and timeline displays, a graph-based visualization using Parallel Performance Flow Graphs (PPFGs) is introduced. This novel technical approach is using program states in order to display similarities and differences between the potentially very large number of event streams and, thus, enables a fast way to spot load imbalances. The thesis concludes with the in-depth analysis of a case-study of PIConGPU---a highly parallel, multi-hybrid plasma physics simulation---that benefited greatly from the developed performance analysis methods. / Diese Dissertation zeigt, wie der Ablauf von Anwendungsteilen, die auf Hardwarebeschleuniger ausgelagert wurden, als Programmspur mit aufgezeichnet werden kann. Damit wird die bekannte Technik der Leistungsanalyse von Anwendungen mittels Programmspuren so erweitert, dass auch diese neue Parallelitätsebene mit erfasst wird. Die Beschränkungen von Computersystemen bezüglich der elektrischen Leistungsaufnahme hat zu einer steigenden Anzahl von hybriden Computerarchitekturen geführt. Sowohl Hochleistungsrechner, aber auch Arbeitsplatzcomputer und mobile Endgeräte nutzen heute Hardwarebeschleuniger um rechenintensive, parallele Programmteile auszulagern und so den skalaren Hauptprozessor zu entlasten und nur für nicht parallele Programmteile zu verwenden. Dieses Ausführungsschema ist typischerweise asynchron: der Skalarprozessor kann, während der Hardwarebeschleuniger rechnet, selbst weiterarbeiten. Die Leistungsanalyse-Werkzeuge der Hersteller von Hardwarebeschleunigern decken den Standardfall (ein Host-System mit einem Hardwarebeschleuniger) sehr gut ab, scheitern aber an einer Unterstützung von hochparallelen Rechnersystemen. Die vorliegende Dissertation untersucht, in wie weit auch multi-hybride Anwendungen die Aktivität von Hardwarebeschleunigern aufzeichnen können. Dazu wird die vorhandene Methode zur Erzeugung von Programmspuren für hochparallele Anwendungen entsprechend erweitert. In dieser Untersuchung wird zuerst eine allgemeine Methodik entwickelt, mit der sich für jede API-gestützte Hardwarebeschleunigung eine Programmspur erstellen lässt. Darauf aufbauend wird eine eigene Programmierschnittstelle entwickelt, die es ermöglicht weitere leistungsrelevante Daten aufzuzeichnen. Die Umsetzung dieser Schnittstelle wird am Beispiel von NVIDIA CUPTI darstellt. Ein weiterer Teil der Arbeit beschäftigt sich mit der Darstellung von Programmspuren, welche Aufzeichnungen von den unterschiedlichen Parallelitätsebenen enthalten. Um die Einschränkungen klassischer Leistungsprofile oder Zeitachsendarstellungen zu überwinden, wird mit den parallelen Programmablaufgraphen (PPFGs) eine neue graphenbasisierte Darstellungsform eingeführt. Dieser neuartige Ansatz zeigt eine Programmspur als eine Folge von Programmzuständen mit gemeinsamen und unterchiedlichen Abläufen. So können divergierendes Programmverhalten und Lastimbalancen deutlich einfacher lokalisiert werden. Die Arbeit schließt mit der detaillierten Analyse von PIConGPU -- einer multi-hybriden Simulation aus der Plasmaphysik --, die in großem Maße von den in dieser Arbeit entwickelten Analysemöglichkeiten profiert hat.