Submitted by Geandra Rodrigues (geandrar@gmail.com) on 2018-05-10T12:15:28Z No. of bitstreams: 1 alexandredasilvafernandes.pdf: 3326554 bytes, checksum: f4dfcfe70bde99c5ebe4501f03add83e (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2018-05-22T15:33:53Z (GMT) No. of bitstreams: 1 alexandredasilvafernandes.pdf: 3326554 bytes, checksum: f4dfcfe70bde99c5ebe4501f03add83e (MD5) / Made available in DSpace on 2018-05-22T15:33:53Z (GMT). No. of bitstreams: 1 alexandredasilvafernandes.pdf: 3326554 bytes, checksum: f4dfcfe70bde99c5ebe4501f03add83e (MD5) Previous issue date: 2018-02-20 / O planejamento da operação do Sistema Interligado Nacional constitui-se uma tarefa de alta complexidade, seja pela quantidade acentuada de usinas hidrelétricas e termelétricas distribuídas nos quatro submercados interligados, ou pelas características marcantes da operação das hidrelétricas, no que diz respeito às incertezas dos cenários hidrológicos futuros e aos acoplamentos espacial e temporal. O objetivo deste planejamento é a determinação de uma política ótima de despacho das usinas do sistema de modo a minimizar o valor esperado dos custos operativos no horizonte considerado. Uma importante restrição do problema é o suprimento da demanda de energia elétrica, dado pela diferença entre a carga efetiva de cada submercado e a geração das usinas não simuladas, esta última composta pela energias alternativas (eólica, solar, biomassa), pequenas centrais hidrelétricas, entre outros. Entretanto, a crescente penetração da geração renovável, aliada às incertezas das fontes naturais como eólica e solar (pois dependem de fatores climáticos e por isso são imprevisíveis), contribui com a necessidade de representação da demanda em diversos cenários para um correto despacho das usinas e uma operação do sistema mais confiável. Sabendo que os modelos oficiais atuais tratam apenas as incertezas oriundas dos cenários hidrológicos, devido à dificuldade de implementação e alocação de memória na consideração de outras incertezas na Programação Dinâmica Dual Estocástica, o trabalho desenvolvido nesta dissertação propõe metodologias que incluem os diversos cenários de demanda, além de representar com maior detalhe a geração das hidrelétricas. Além disso, são propostos algoritmos de representação analítica da Função de Custo Imediato em sistemas isolados e com múltiplas áreas na busca por uma redução das dimensões do problema tratado. Finalmente, são realizados testes em sistemas tutorias e os resultados são analisados para avaliar as performances computacionais das metodologias propostas. / The operation schedulling of Brazilian System constitutes a task of high complexity, either due to the large number of hydro and thermal plants distributed in the four interconnected submarkets, or due to the outstanding characteristics of the hydro plants, with respect to the uncertainties in the hydrological scenarios future and due to spatial and temporal couplings. The objective of this planning is the determination of an optimal dispatch policy of plants that minimizes the expected value of the operating costs in the considered horizon. An important constraint is the supply of demand, which is obtained by the difference between the effective load of each submarket and the generation of non-simulated plants, composed of renewable energies (wind, solar, biomass), small hydropower plants, and others. However, the growing penetration of renewable generation, coupled with the uncertainties of natural sources such as wind and solar (because they depend on climatic factors and are therefore unpredictable), contributes to the need to represent demand in different scenarios for a correct dispatch of the plants and a more reliable system operation. Knowing that the current official models deal only with the uncertainties arising from the hydrological scenarios, due to the difficulty of implementation and memory allocation in the consideration of other uncertainties in Stochastic Dual Dynamic Programming, this work proposes methodologies that include the several scenarios demand, besides representing in greater detail the generation of hydroelectric plants. In addition, algorithms are proposed for analytical representation of the Immediate Cost Function in isolated systems with multiple areas in the search for a reduction of the dimensions of the problem. Finally, tests are performed on tutorial systems and the results are analyzed to evaluate the computational performances of the proposed methodologies.

This thesis describes the theory of model predictive control and application of the theory to synchronous drives. It shows explicit and on-line solutions and compares the results with classical vector control structure.

This thesis deals with model predictive control principally Based Predictive Control (MPC). The first part describes the principle of predictive control, cost function, the choice of a constraints in regulation and the choice of weights. In the next section is an analysis system: a system with non-minimal phase (control water turbine), oscillating systems (trolley frame control) and system with a time-delay . In all of these systems is performed classical feedback control using PID control and concurrently regulation with the MPC. MPC is selected as the solution fy Mathworks Model Predictive Control Toolbox and Simulink. The results are then analyzed using the criteria of quality control.

Reporting functions reflect a novel technique to formulate sequence-oriented queries in SQL. They extend the classical way of grouping and applying aggregation functions by additionally providing a column-based ordering, partitioning, and windowing mechanism. The application area of reporting functions ranges from simple ranking queries (TOP(n)-analyses) over cumulative (Year-To-Date-analyses) to sliding window queries. We discuss the problem of deriving reporting function queries from materialized reporting function views, which is one of the most important issues in efficiently processing queries in a data warehouse environment. Two different derivation algorithms, including their relational mappings are introduced and compared in a test scenario.

The aim of this master thesis is to study algorithms for automatically tuning antenna parameters to improve the performance of the radio access part of a telecommunication network and user experience. There are four dierent optimization algorithms, Stepwise Minimization Algorithm, Random Search Algorithm, Modied Steepest Descent Algorithm and Multi-Objective Genetic Algorithm to be applied to a model of a radio access network. The performances of all algorithms will be evaluated in this thesis. Moreover, a graphical user interface which is developed to facilitate the antenna tuning simulations will also be presented in the appendix of the report.

Multi-parti de conférence multimédia est le type le plus compliqué de la communication mais aussi le service principalement utilisé sur Internet. Il est aussi la killer application sur les réseaux 4G. Dans cette recherche, nous nous concentrons sur trois parties principales du service de téléconférence: L'architecture de distribution de médias, le codage vidéo, ainsi que l'intégration du service dans les infrastructures sans fil 4G. Nous proposons un algorithme d'application nouvelle couche de multidiffusion utilisant une architecture de services distribués. L'algorithme proposé estime que les limites de la perception humaine, tout en participant à une conférence vidéo afin de minimiser le trafic qui n'est pas nécessaire pour la session de communication. Riche des modèles théoriques de la perception basée proposé architecture distribuée, l'architecture traditionnelle centralisée et basée sur la perception architecture centralisée ont été construits en utilisant la théorie d'attente afin de refléter le trafic généré, transmises et traitées à l'pairs distribués, les dirigeants et le serveur centralisé. La performance des architectures a été pris en compte dans les différents aspects de la durée totale d'attente, le retard de point à point et le taux de service requis pour le débit total. Ces résultats aident le lecteur à avoir une vue globale des performances de la proposition dans une comparaison équitable avec les méthodes conventionnelles. Pour construire l'arbre de distribution des médias pour l'architecture distribuée, une fonction de coût nouvelle application-aware multi-variable est proposée. Il tient compte des besoins variables des applications et des mises à jour dynamiquement les ressources disponibles nécessaires pour parvenir à un nœud particulier sur l'arbre de distribution de l'ALM. Codage vidéo scalable est utilisé comme le principal multi-couche codec à la conférence. Afin d'évaluer la performance de la fonction de coût multi-variable nouvellement proposées dans une application dynamique et avancé environnement réseau sans fil, codage vidéo scalable (SVC) des transmissions sur un réseau overlay ALM construite sur un réseau sous-4G/WiMAX réelles ont été utilisées. Nous avons développé EvalSVC et l'utiliser comme plate-forme principale pour évaluer la fonction de coût proposé. Comme un problème commun, l'architecture distribuée nécessite que les pairs contribuent une partie de leur bande passante et capacité de calcul afin de maintenir la superposition mutuelle inter-connexion. Cette exigence se développe en un grave problème pour les utilisateurs mobiles et l'infrastructure sans fil, comme la ressource radio de ce réseau est extrêmement coûteux, et est l'une des raisons pour lesquelles l'architecture distribuée n'a pas été largement appliquée dans la prochaine génération (4G) des réseaux. C'est aussi la raison principale pour laquelle les services multimédias tels que vidéo-conférence doivent s'appuyer sur une architecture centralisée coûteuse construite sur un des contrôleurs des médias coûteux fonction des ressources (CRFM), via l'IMS (IP Multimedia Subsystem). Ce travail de recherche propose une nouvelle architecture distribuée utilisant la capacité de renseignement et extra, actuellement disponibles sur le LTE et stations de base WiMAX de réduire le besoin des débits que chacun a à fournir par les pairs afin de maintenir le réseau overlay. Cette réduction permet d'économiser des ressources précieuses et de radio permet une architecture distribuée pour fournir des services de visioconférence sur les réseaux 4G, avec tous les avantages d'une architecture distribuée, comme la flexibilité, l'évolutivité, les petits retards et à moindre coût. De plus, cela peut être mis en œuvre avec une modification minimale de la plate-forme standardisée IMS et les infrastructures 4G, économisant ainsi les opérateurs et les fournisseurs de services d'investissements excessifs. [...] / Multimedia services are the killer applications on next generation convergent networks. Video contents are the most resource consuming part of a multimedia flux. Video transmission, video multicast and video conferencing services are the most popular types of video communication with increasing difficulty levels. Four main parts of the distributed cross-layer scalable multimedia services over next generation convergent networks are considered in this research work, both from the architecture and performance point of views. Firstly, we evaluate the performance of scalable multimedia transmissions over an overlay network. For that, we evaluate the performance of scalable video end-to-end transmissions over EvalSVC. It is capable of evaluating the end-to-end transmission of SVC bit-streams. The output results are both objective and subjective metrics of the video transmission. Through the interfaces with real networks and an overlay simulation platform, the transmission performance of different types of SVC scalability and AVC bit-streams on a bottle-neck and an overlay network will be evaluated. This evaluation is new because it is conducted on the end-to-end transmission of SVC contents and not on the coding performance. Next, we will study the multicast mechanism for multimedia content over an overlay network in the following part of this PhD thesis. Secondly, we tackle the problems of the distributed cross-layer scalable multimedia multicast over the next generation convergent networks. For that, we propose a new application-network cross layer multi-variable cost function for application layer multicast of multimedia delivery over convergent networks. It optimizes the variable requirements and available resources from both the application and the network layers. It can dynamically update the available resources required for reaching a particular node on the ALM's media distribution tree. Mathematical derivation and theoretical analysis have been provided for the newly proposed cost function so that it can be applied in more general cases of different contexts. An evaluation platform of an overlay network built over a convergent underlay network comprised of a simulated Internet topology and a real 4G mobile WiMAX IEEE802.16e wireless network is constructed. If multicast is the one-to-many mechanism to distribute the multimedia content, a deeper study on the many-to-many mechanism will be done in the next part of the thesis through a new architecture for video conferencing services. Thirdly, we study the distributed cross-layer scalable video conferencing services over the overlay network. For that, an enriched human perception-based distributed architecture for scalable video conferencing services is proposed with theoretical models and performance analysis. Rich theoretical models of the three different architectures: the proposed perception-based distributed architecture, the conventional centralized architecture and perception-based centralized architecture have been constructed by using queuing theory to reflect the traffic generated, transmitted and processed at the perception-based distributed leaders, the perception-based centralized top leader, and the centralized server. The performance of these three different architectures has been considered in 4 different aspects. While the distributed architecture is better than the centralized architecture for a scalable multimedia conferencing service, it brings many problems to users who are using a wireless network to participate into the conferencing service. A special solution should be found out for mobile users in the next part of the thesis. Lastly, the distributed cross-layer scalable video conferencing services over the next generation convergent network is enabled. For that, an IMS-based distributed multimedia conferencing services for Next Generation Convergent Networks is proposed. [...]

No description available.

Cette thèse porte sur deux sujets intrinsèquement liés : le calcul de la constante de normalisation d’un champ de Markov et l’estimation de l’affinité de liaison d’un complexe de protéines. Premièrement, afin d’aborder ce problème de comptage #P complet, nous avons développé Z*, basé sur un élagage des quantités de potentiels négligeables. Il s’est montré plus performant que des méthodes de l’état de l’art sur des instances issues d’interaction protéine-protéine. Par la suite, nous avons développé #HBFS, un algorithme avec une garantie anytime, qui s’est révélé plus performant que son prédécesseur. Enfin, nous avons développé BTDZ, un algorithme exact basé sur une décomposition arborescente qui a fait ses preuves sur des instances issues d’interaction intermoléculaire appelées “superhélices”. Ces algorithmes s’appuient sur des méthodes issuse des modèles graphiques : cohérences locales, élimination de variable et décompositions arborescentes. A l’aide de méthodes d’optimisation existantes, de Z* et des fonctions d’énergie de Rosetta, nous avons développé un logiciel open source estimant la constante d’affinité d’un complexe protéine protéine sur une librairie de mutants. Nous avons analysé nos estimations sur un jeu de données de complexes de protéines et nous les avons confronté à deux approches de l’état de l’art. Il en est ressorti que notre outil était qualitativement meilleur que ces méthodes. / This thesis is focused on two intrinsically related subjects : the computation of the normalizing constant of a Markov random field and the estimation of the binding affinity of protein-protein interactions. First, to tackle this #P-complete counting problem, we developed Z*, based on the pruning of negligible potential quantities. It has been shown to be more efficient than various state-of-the-art methods on instances derived from protein-protein interaction models. Then, we developed #HBFS, an anytime guaranteed counting algorithm which proved to be even better than its predecessor. Finally, we developed BTDZ, an exact algorithm based on tree decomposition. BTDZ has already proven its efficiency on intances from coiled coil protein interactions. These algorithms all rely on methods stemming from graphical models : local consistencies, variable elimination and tree decomposition. With the help of existing optimization algorithms, Z* and Rosetta energy functions, we developed a package that estimates the binding affinity of a set of mutants in a protein-protein interaction. We statistically analyzed our esti- mation on a database of binding affinities and confronted it with state-of-the-art methods. It appears that our software is qualitatively better than these methods.

Many different approaches have been taken towards solving the stereo correspondence problem and great progress has been made within the field during the last decade. This is mainly thanks to newly evolved global optimization techniques and better ways to compute pixel dissimilarity between views. The most successful algorithms are based on approaches that explicitly model smoothness assumptions made about the physical world, with image segmentation and plane fitting being two frequently used techniques. Within the project, a survey of state of the art stereo algorithms was conducted and the theory behind them is explained. Techniques found interesting were implemented for experimental trials and an algorithm aiming to achieve state of the art performance was implemented and evaluated. For several cases, state of the art performance was reached. To keep down the computational complexity, an algorithm relying on local winner-take-all optimization, image segmentation and plane fitting was compared against minimizing a global energy function formulated on pixel level. Experiments show that the local approach in several cases can match the global approach, but that problems sometimes arise – especially when large areas that lack texture are present. Such problematic areas are better handled by the explicit modeling of smoothness in global energy minimization. Lastly, disparity estimation for image sequences was explored and some ideas on how to use temporal information were implemented and tried. The ideas mainly relied on motion detection to determine parts that are static in a sequence of frames. Stereo correspondence for sequences is a rather new research field, and there is still a lot of work to be made.

The aim of the thesis is to describe the purpose, content and methods of economic analysis in the theoretical part. The application part continues by application of the theoretical findings to financial statements of ITW PRONOVIA, s.r.o. company of years 2009 to 2014. The most important elements are horizontal and vertical analysis, ratio indicators, DuPont analysis, working-capital analysis, economic value added (EVA), Value and Bankruptcy models and labor productivity analysis.