The following master thesis is focused on creation of methodology for optimal usage of load balancing in data center environment. Thesis is divided into eight chapters. The first chapter describes the reasons why to deal with this topic further. The second chapter summarizes the state of load balancing. This chapter is based on research of already elaborated thesis which were focused on load balancing in different ways. The third chapter summarizes load balancing including its key principles. The fourth chapter describes an actual state of load balancing in data center environment. An observation of real usage of load balancing in selected data center was used for the main purpose of this chapter. The fifth chapter consists of analysis of the currently existing methodologies which are used from the infrastructure projects purpose. The sixth chapter deals with creation of methodology for optimal usage of load balancing in data center. The seventh chapter evaluates usage of methodology by applying of this methodology to real practical example of implementation of load balancing. The eighth chapter summarizes all detected conclusions.

Typical aero-engine assemblies have at least two nested rotors mounted within a flexible casing via squeeze-film damper (SFD) bearings. As a result, the flexible casing structures become highly sensitive to the vibration excitation arising from the High and Low pressure rotors. Lowering vibrations at the aircraft engine casing can reduce harmful effects on the aircraft engine. Inverse problem techniques provide a means toward solving the unbalance identification problem for a rotordynamic system supported by nonlinear SFD bearings, requiring prior knowledge of the structure and measurements of vibrations at the casing. This thesis presents two inverse solution techniques for the nonlinear rotordynamic inverse problem, which are focused on applications where the rotor is inaccessible under operating conditions, e.g. high pressure rotors. Numerical and experimental validations under hitherto unconsidered conditions have been conducted to test the robustness of each technique. The main contributions of this thesis are:• The development of a non-invasive inverse procedure for unbalance identification and balancing of a nonlinear SFD rotordynamic system. This method requires at least a linear connection to ensure a well-conditioned explicit relationship between the casing vibration and the rotor unbalance via frequency response functions. The method makes no simplifying assumptions made in previous research e.g. neglect of gyroscopic effects; assumption of structural isotropy; restriction to one SFD; circular centred orbits (CCOs) of the SFD. • The identification and validation of the inverse dynamic model of the nonlinear SFD element, based on recurrent neural networks (RNNs) that are trained to reproduce the Cartesian displacements of the journal relative to the bearing housing, when presented with given input time histories of the Cartesian SFD bearing forces.• The empirical validation of an entirely novel approach towards the solution of a nonlinear inverse rotor-bearing problem, one involving an identified empirical inverse SFD bearing model. This method is suitable for applications where there is no adequate linear connection between rotor and casing. Both inverse solutions are formulated using the Receptance Harmonic Balance Method (RHBM) as the underpinning theory. The first inverse solution uses the RHBM to generate the backwards operator, where a linear connection is required to guarantee an explicit inverse solution. A least-squares solution yields the equivalent unbalance distribution in prescribed planes of the rotor, which is consequently used to balance it. This method is successfully validated on distinct rotordynamic systems, using simulated data considering different practical scenarios of error sources, such as noisy data, model uncertainty and balancing errors. Focus is then shifted to the second inverse solution, which is experimentally-based. In contrast to the explicit inverse solution, the second alternative uses the inverse SFD model as an implicit inverse solution. Details of the SFD test rig and its set up for empirical identification are presented. The empirical RNN training process for the inverse function of an SFD is presented and validated as a part of a nonlinear inverse problem. Finally, it is proved that the RNN could thus serve as reliable virtual instrumentation for use within an inverse rotor-bearing problem.

L’analyse de flux de données est utilisée dans beaucoup de contexte où la masse des données et/ou le débit auquel elles sont générées, excluent d’autres approches (par exemple le traitement par lots). Le modèle flux fourni des solutions aléatoires et/ou fondées sur des approximations pour calculer des fonctions d’intérêt sur des flux (repartis) de n-uplets, en considérant le pire cas, et en essayant de minimiser l’utilisation des ressources. En particulier, nous nous intéressons à deux problèmes classiques : l’estimation de fréquence et les poids lourds. Un champ d’application moins courant est le traitement de flux qui est d’une certaine façon un champ complémentaire aux modèle flux. Celui-ci fournis des systèmes pour effectuer des calculs génériques sur les flux en temps réel souple, qui passent à l’échèle. Cette dualité nous permet d’appliquer des solutions du modèle flux pour optimiser des systèmes de traitement de flux. Dans cette thèse, nous proposons un nouvel algorithme pour la détection d’éléments surabondants dans des flux repartis, ainsi que deux extensions d’un algorithme classique pour l’estimation des fréquences des items. Nous nous intéressons également à deux problèmes : construire un partitionnement équitable de l’univers des n-uplets par rapport à leurs poids et l’estimation des valeurs de ces n-uplets. Nous utilisons ces algorithmes pour équilibrer et/ou délester la charge dans les systèmes de traitement de flux. / Nowadays stream analysis is used in many context where the amount of data and/or the rate at which it is generated rules out other approaches (e.g., batch processing). The data streaming model provides randomized and/or approximated solutions to compute specific functions over (distributed) stream(s) of data-items in worst case scenarios, while striving for small resources usage. In particular, we look into two classical and related data streaming problems: frequency estimation and (distributed) heavy hitters. A less common field of application is stream processing which is somehow complementary and more practical, providing efficient and highly scalable frameworks to perform soft real-time generic computation on streams, relying on cloud computing. This duality allows us to apply data streaming solutions to optimize stream processing systems. In this thesis, we provide a novel algorithm to track heavy hitters in distributed streams and two extensions of a well-known algorithm to estimate the frequencies of data items. We also tackle two related problems and their solution: provide even partitioning of the item universe based on their weights and provide an estimation of the values carried by the items of the stream. We then apply these results to both network monitoring and stream processing. In particular, we leverage these solutions to perform load shedding as well as to load balance parallelized operators in stream processing systems.

This study explores how great powers not allied with the United States formulate their grand strategies in a unipolar international system. Specifically, it analyzes the strategies China and Russia have developed to deal with U.S. hegemony by examining how Moscow and Beijing have responded to American intervention in Central Asia. The study argues that China and Russia have adopted a soft balancing strategy of to indirectly balance the United States at the regional level. This strategy uses normative capabilities such as soft power, alternative institutions and regionalization to offset the overwhelming material hardware of the hegemon. The theoretical and methodological approach of this dissertation is neoclassical realism. Chinese and Russian balancing efforts against the United States are based on their domestic dynamics as well as systemic constraints. Neoclassical realism provides a bridge between the internal characteristics of states and the environment which those states are situated. Because China and Russia do not have the hardware (military or economic power) to directly challenge the United States, they must resort to their software (soft power and norms) to indirectly counter American preferences and set the agenda to obtain their own interests. Neoclassical realism maintains that soft power is an extension of hard power and a reflection of the internal makeup of states. The dissertation uses the heuristic case study method to demonstrate the efficacy of soft balancing. Such case studies help to facilitate theory construction and are not necessarily the demonstrable final say on how states behave under given contexts. Nevertheless, it finds that China and Russia have increased their soft power to counterbalance the United States in certain regions of the world, Central Asia in particular. The conclusion explains how soft balancing can be integrated into the overall balance-of-power framework to explain Chinese and Russian responses to U.S. hegemony. It also suggests that an analysis of norms and soft power should be integrated into the study of grand strategy, including both foreign policy and military doctrine.

Este trabalho apresenta o projeto e a implementação da política de escalonamento com suporte à migração de processos JUMP. A migração de processos é uma ferramenta importante que complementa a alocação inicial realizada pela política de escalonamento em um ambiente paralelo distribuído, permitindo um balanceamento de carga dinâmico e mais refinado, resultando em um melhor desempenho do ambiente e menor tempo de resposta das aplicações paralelas distribuídas. A nova política unifica a alocação inicial e migração de processos em um único algoritmo, de forma a compartilhar decisões para o objetivo comum de prover um melhor desempenho para aplicações de uso intensivo de processamento em clusters heterogêneos. A política é implementada sobre o ambiente de escalonamento flexível e dinâmico AMIGO, adaptado para o suporte à migração de processos. A avaliação de desempenho mostrou que a nova política oferece ganhos expressivos nos tempos de resposta quando comparada às outras duas políticas de escalonamento implementadas no AMIGO, em quase todos os cenários, para diversas aplicações e diversas situações de carga do ambiente / This work presents the project and implementation of the scheduling policy with process migration support JUMP. Process migration is an important tool that complements the initial placement performed by the scheduling policy in a distributed parallel environment, allowing for dynamic and more refined load balancing, resulting in better performance of the environment and shorter response time for distributed parallel applications. The new policy unifies initial placement and process migration in a single algorithm, enabling the sharing of decisions for the common goal of providing a better performance for CPU-bound applications in heterogeneous clusters. The policy is implemented over the dynamical and flexible environment AMIGO, adapted in order to support process migration. Performance evaluation showed that the new policy offers expressive gains in response times when compared to other two scheduling policies implemented in AMIGO in almost all scenarios, for different applications and different environment load situations

Algoritmos de balanceamento de carga são utilizados em sistemas distribuídos para homogeneizar a ocupação dos recursos computacionais disponíveis. A homogeneidade na ocupação do ambiente permite otimizar a alocação de recursos e, conseqüentemente, aumentar o desempenho das aplicações. Com o advento dos sistemas distribuídos de alta escala, fazem-se necessárias pesquisas para a construção de algoritmos de balanceamento de carga que sejam capazes de gerir com eficiência esses sistemas. Essa eficiência é medida através do número de mensagens geradas no ambiente, do suporte a ambientes heterogêneos, do uso de políticas que consomem poucos recursos do sistema, da estabilidade em alta carga, da escalabilidade do sistema e dos baixos tempos de resposta. Com o objetivo de atender as necessidades dos sistemas distribuídos de alta escala, este doutorado propõe, apresenta e avalia um novo algoritmo de balanceamento de carga denominado TLBA (Tree Load Balancing Algorithm). Esse algoritmo organiza os computadores do sistema em uma topologia lógica na forma de árvore, sobre a qual são executadas operações de balanceamento de carga. Para validar o TLBA foi construído um simulador que, submetido a testes, permitiu comprovar suas contribuições, que incluem: o baixo número de mensagens geradas pelas operações de balanceamento de carga; a estabilidade em altas cargas; os baixos tempos médios de resposta de processos. Para validar os resultados de simulação, foi construído um protótipo do TLBA. Esse protótipo confirmou os resultados de simulação e, conseqüentemente, as contribuições do algoritmo. / Load balancing algorithms are applied in distributed systems to homogenize the occupation of the available computational resources. The homogeneity of the environment occupation allows optimising the resource allocation and consequently, increasing the application performance. With the advent of the large-scale distributed systems, it was necessary to start researching the construction of load balancing algorithms which are able to manage these systems with efficiency. This efficiency is measured through the number of messages generated on the environment; the support to heterogeneous environments and the load balance policies which should spend the minimal resources time; the stability in overloaded situations; the system scalability; and the processes average response times, that should be small. With the aim to achieve the large-scale distributed systems requirements, this Ph.D. proposes, presents and evaluates a new load balancing algorithm named TLBA (Tree Load Balancing Algorithm). This algorithm arranges the computers on a logical network topology with a tree format. The load balancing operations are executed over this tree. To evaluate the TLBA algorithm, a simulator was built that was submitted to tests that confirmed the following characteristics: the small number of messages generated by the load balancing operations; the stability in overloaded situations; the small average processes response times. To validate the simulation results a TLBA prototype was implemented. This prototype confirmed the simulation results and consequently the contributions of the proposed algorithm.

abstract: Bicycle stabilization has become a popular topic because of its complex dynamic behavior and the large body of bicycle modeling research. Riding a bicycle requires accurately performing several tasks, such as balancing and navigation which may be difficult for disabled people. Their problems could be partially reduced by providing steering assistance. For stabilization of these highly maneuverable and efficient machines, many control techniques have been applied – achieving interesting results, but with some limitations which includes strict environmental requirements. This thesis expands on the work of Randlov and Alstrom, using reinforcement learning for bicycle self-stabilization with robotic steering. This thesis applies the deep deterministic policy gradient algorithm, which can handle continuous action spaces which is not possible for Q-learning technique. The research involved algorithm training on virtual environments followed by simulations to assess its results. Furthermore, hardware testing was also conducted on Arizona State University’s RISE lab Smart bicycle platform for testing its self-balancing performance. Detailed analysis of the bicycle trial runs are presented. Validation of testing was done by plotting the real-time states and actions collected during the outdoor testing which included the roll angle of bicycle. Further improvements in regard to model training and hardware testing are also presented. / Dissertation/Thesis / Masters Thesis Mechanical Engineering 2020

No description available.

This thesis solves hydraulic regulation existing heating system apartment building. It is a building of eight floors with dimensions of 21.0 x 26.0 m. The system se-amlessly heats the entire building residential building. Heating is the most original apartment, dealt with cast iron radiators. The heat source is CZT. The theoretical part is focused on the revitalization of heating systems.

The purpose of this thesis is to design a powertrain of petrol three-cylinder radial aircraft engine with the main parameters specified (bore, stroke, etc.), balancing inertia forces, stress analysis and determining of fatigue of the selected parts.