Notre société étant plus dépendante que jamais au vecteur électrique, la moindre perturbation du transport ou de l’acheminement de l’électricité a un impact social et économique important. La fiabilité et la sécurité des réseaux électriques sont donc cruciales pour les gestionnaires de réseaux, en plus des aspects économiques. De plus, les réseaux de transport sont interconnectés pour réduire les coûts des opérations et pour améliorer la sécurité. Un des plus grand défis des gestionnaires des réseaux de transport est ainsi de se coordonner avec les réseaux voisins, ce qui soulève des problèmes liés à la taille du problème, à l’interopérabilité et à la confidentialité des données.Cette thèse se focalise principalement sur la sécurité des opérations sur les réseaux électriques, c’est pourquoi l’évolution des principales caractéristiques des blackouts, qui sont des échecs de la sécurité des réseaux, sont étudiés sur la période 2005-2016. L’approche de cette étude consiste à déterminer quelles sont les principales caractéristiques des incidents de ces 10 dernières années, afin d’identifier ce qui devrait être intégré pour réduire le risque que ces incidents se reproduisent. L’évolution a été étudiée et comparé avec les caractéristiques des blackouts qui se sont produit avant 2005. L’étude se focalise sur les préconditions qui ont mené à ces blackouts et sur les cascades, et particulièrement sur le rôle de la vitesse des cascades. Les caractéristiques importante sont extraites et intégrées dans la suite de notre travail.Un algorithme résolvant un problème préventif d’Optimal Power Flow avec contraintes de sécurité (SCOPF) de manière distribuée est ainsi développé. Ce problème consiste en l’ajout de contraintes qui assure qu’après la perte de n’importe quel appareil d’importance, le nouveau point d’équilibre, atteint suite au réglage primaire en fréquence, respecte les contraintes du système. L’algorithme développé utilise une décomposition fine du problème et est implémenté sous le paradigme multi-agent, basé sur deux catégories d’agents : les appareils et les bus. Les agents sont coordonnés grâce à l’ « Alternating Direction Method of Multipliers (ADMM)» et grâce à un problème de consensus. Cette décomposition procure l’autonomie et la confidentialité nécessaire aux différents acteurs du système, mais aussi, un bon passage à l’échelle par rapport à la taille du problème. Cet algorithme a aussi pour avantage d’être robuste à n’importe quelle perturbation, incluant la séparation du système en plusieurs régions.Puis, pour prendre en compte l’incertitude sur la production créée par les erreurs de prédiction des fermes éoliennes, une approche distribuée à deux étapes est développée pour résoudre un problème d’Optimal Power Flow avec contraintes probabilistes (CCOPF), d’une manière complétement distribuée. Les erreurs de prédiction des fermes éoliennes sont modélisées par des lois normales indépendantes et les écarts par rapport aux plannings de production sont considérés compensés par le réglage primaire en fréquence. La première étape de l’algorithme a pour but de déterminer des paramètres de sensibilités nécessaires pour formuler le problème. Les résultats de cette étape sont ensuite des paramètres d’entrée de la seconde étape qui, elle, résout le problème de CCOPF. Une extension de cette formulation permet d’ajouter de la flexibilité au problème en permettant la réduction de la production éolienne. Cet algorithme est basé sur la même décomposition fine que précédemment où les agents sont également coordonnés par l’ADMM et grâce à un problème de consensus. En conclusion, cet algorithme en deux étapes garantit la confidentialité et l’autonomie des différents acteurs, et est parallèle et adaptée aux plateformes hautes performances. / Our societies are more dependent on electricity than ever, thus any disturbance in the power transmission and delivery has major economic and social impact. The reliability and security of power systems are then crucial to keep, for power system operators, in addition to minimizing the system operating cost. Moreover, transmission systems are interconnected to decrease the cost of operation and improve the system security. One of the main challenges for transmission system operators is therefore to coordinate with interconnected power systems, which raises scalability, interoperability and privacy issues. Hence, this thesis is concerned with how TSOs can operate their networks in a decentralized way but coordinating their operation with other neighboring TSOs to find a cost-effective scheduling that is globally secure.The main focus of this thesis is the security of power systems, this is why the evolution of the main characteristics of the blackouts that are failures in power system security, of the period 2005-2016 is studied. The approach consists in determining what the major characteristics of the incidents of the past 10 years are, to identify what should be taken into account to mitigate the risk of incidents. The evolution have been studied and compared with the characteristics of the blackouts before 2005. The study focuses on the pre-conditions that led to those blackouts and on the cascades, and especially the role of the cascade speed. Some important features are extracted and later integrated in our work.An algorithm that solve the preventive Security Constrained Optimal Power Flow (SCOPF) problem in a fully distributed manner, is thus developed. The preventive SCOPF problem consists in adding constraints that ensure that, after the loss of any major device of the system, the new steady-state reached, as a result of the primary frequency control, does not violate any constraint. The developed algorithm uses a fine-grained decomposition and is implemented under the multi-agent system paradigm based on two categories of agents: devices and buses. The agents are coordinated with the Alternating Direction method of multipliers in conjunction with a consensus problem. This decomposition provides the autonomy and privacy to the different actors of the system and the fine-grained decomposition allows to take the most of the decomposition and provides a good scalability regarding the size of the problem. This algorithm also have the advantage of being robust to any disturbance of the system, including the separation of the system into regions.Then, to account for the uncertainty of production brought by wind farms forecast error, a two-step distributed approach is developed to solve the Chance-Constrained Optimal Power Flow problem, in a fully distributed manner. The wind farms forecast errors are modeled by independent Gaussian distributions and the mismatches with the initials are assumed to be compensated by the primary frequency response of generators. The first step of this algorithm aims at determining the sensitivity factors of the system, needed to formulate the problem. The results of this first step are inputs of the second step that is the CCOPF. An extension of this formulation provides more flexibility to the problem and consists in including the possibility to curtail the wind farms. This algorithm relies on the same fine-grained decomposition where the agents are again coordinated by the ADMM and a consensus problem. In conclusion, this two-step algorithm ensures the privacy and autonomy of the different system actors and it is de facto parallel and adapted to high performance platforms.

L’objectif principal de cette thèse est l’exploration du recalage d’images à l’aide de champs aléatoires de Markov d’ordres supérieurs, et plus spécifiquement d’intégrer la connaissance de transformations globales comme une transformation rigide, dans la structure du graphe. Notre cadre principal s’applique au recalage 2D-2D ou 3D-3D et utilise une approche hiérarchique d’un modèle de champ de Markov dont le graphe est une grille régulière. Les variables cachées sont les vecteurs de déplacements des points de contrôle de la grille.Tout d’abord nous expliciterons la construction du graphe qui permet de recaler des images en cherchant entre elles une transformation affine, rigide, ou une similarité, tout en ne changeant qu’un potentiel sur l’ensemble du graphe, ce qui assure une flexibilité lors du recalage. Le choix de la métrique est également laissée à l’utilisateur et ne modifie pas le fonctionnement de notre algorithme. Nous utilisons l’algorithme d’optimisation de décomposition duale qui permet de gérer les hyper-arêtes du graphe et qui garantit l’obtention du minimum exact de la fonction pourvu que l’on ait un accord entre les esclaves. Un graphe similaire est utilisé pour réaliser du recalage 2D-3D.Ensuite, nous fusionnons le graphe précédent avec un autre graphe construit pour réaliser le recalage déformable. Le graphe résultant de cette fusion est plus complexe et, afin d’obtenir un résultat en un temps raisonnable, nous utilisons une méthode d’optimisation appelée ADMM (Alternating Direction Method of Multipliers) qui a pour but d’accélérer la convergence de la décomposition duale. Nous pouvons alors résoudre simultanément recalage affine et déformable, ce qui nous débarrasse du biais potentiel issu de l’approche classique qui consiste à recaler affinement puis de manière déformable. / The main objective of this thesis is the exploration of higher order Markov Random Fields for image registration, specifically to encode the knowledge of global transformations, like rigid transformations, into the graph structure. Our main framework applies to 2D-2D or 3D-3D registration and use a hierarchical grid-based Markov Random Field model where the hidden variables are the displacements vectors of the control points of the grid.We first present the construction of a graph that allows to perform linear registration, which means here that we can perform affine registration, rigid registration, or similarity registration with the same graph while changing only one potential. Our framework is thus modular regarding the sought transformation and the metric used. Inference is performed with Dual Decomposition, which allows to handle the higher order hyperedges and which ensures the global optimum of the function is reached if we have an agreement among the slaves. A similar structure is also used to perform 2D-3D registration.Second, we fuse our former graph with another structure able to perform deformable registration. The resulting graph is more complex and another optimisation algorithm, called Alternating Direction Method of Multipliers is needed to obtain a better solution within reasonable time. It is an improvement of Dual Decomposition which speeds up the convergence. This framework is able to solve simultaneously both linear and deformable registration which allows to remove a potential bias created by the standard approach of consecutive registrations.

Thesis: M.S., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 1980 / Includes bibliographical references. / by Conrado Orta, Jr. / M.S. / M.S. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science

published_or_final_version / abstract / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

published_or_final_version / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

Approved for public release; distribution is unlimited / The naval vessels of the future will require lighter, more compact, and more versatile power electronics systems. With the advent of the DC Zonal Electrical Distribution System, more innovative approaches to the conversion of the dc bus power to ac power for motor drives will enhance the efficiency and warfighting capability of tomorrow's ships. This thesis explores the concept of a hybrid dc-ac power converter that combines a hysteresis controlled inverter with a six-step bulk inverter. A six-step bulk inverter is built from discrete components and tested in simulation and hardware. The two inverters are connected in parallel to provide a high-fidelity current source for a three-phase load. The addition of the hysteresis inverter to the bulk inverter adds a closed current loop for more robust control and improves the quality of the output load current. / Major, United States Marine Corps

In this thesis we study the homological behaviour of configuration spaces as the number of objects in the configuration goes to infinity. For unordered configurations of distinct points (possibly equipped with some internal parameters) in a connected, open manifold it is a well-known result, going back to G. Segal and D. McDuff in the 1970s, that these spaces enjoy the property of homological stability. In Chapter 2 we prove that this property also holds for so-called oriented configuration spaces, in which the points of a configuration are equipped with an ordering up to even permutations. There are two important differences from the unordered setting: the rate (or slope) of stabilisation is strictly slower, and the stabilisation maps are not in general split-injective on homology. This can be seen by some explicit calculations of Guest-Kozlowski-Yamaguchi in the case of surfaces. In Chapter 3 we refine their calculations to show that, for an odd prime p, the difference between the mod-p homology of the oriented and the unordered configuration spaces on a surface is zero in a stable range whose slope converges to 1 as p goes to infinity. In Chapter 4 we prove that unordered configuration spaces satisfy homological stability with respect to finite-degree twisted coefficient systems, generalising the corresponding result of S. Betley for the symmetric groups. We deduce this from a general “twisted stability from untwisted stability” principle, which also applies to the configuration spaces studied in the next chapter. In Chapter 5 we study configuration spaces of submanifolds of a background manifold M. Roughly, these are spaces of pairwise unlinked, mutually isotopic copies of a fixed closed, connected manifold P in M. We prove that if the dimension of P is at most (dim(M)−3)/2 then these configuration spaces satisfy homological stability w.r.t. the number of copies of P in the configuration. If P is a sphere this upper bound on its dimension can be increased to dim(M)−3.

This research project sought to explore, compare and develop chemometric methods with the goal of resolving chromatographically overlapped peaks though the use of spectral information gained from the four-way data sets associated with comprehensive two-dimensional liquid chromatography with diode array detection (LC ´ LC-DAD). A chemometric method combining iterative key set factor analysis (IKSFA) and multivariate curve resolution-alternating least squares (MCR-ALS) was developed. In the section of urine data analyzed, over 50 peaks were found, with 18 visually observable and 32 additional compounds found only after application of the chemometric method. Upon successful chemometric resolution of chromatographically overlapped peaks, accurate and precise quantification was then necessary. Of the compared methods for quantification, the manual baseline method was determined to offer the best precisions. Of the 50 found peaks from the urine analysis, 34 were successfully quantified using the manual baseline method with percent relative standard deviations ranging from 0.09 to 16. The accuracy of quantification was then investigated by the analysis of wastewater treatment plant effluent (WWTPE) samples. The chemometrically determined concentration of the unknown phenytoin sample was found to not exhibit a significant difference from the result obtained by the LC-MS/MS reference method, and the precision of the IKSFA-ALS method was better than that of the precision of the LC-MS/MS analysis. Chromatographic factors (data complexity, large dynamic range, retention time shifting, chromatographic and spectral peak overlap and background removal, were all found to affect the quantification results. The last part of this work focused on rapid screening methods that were capable of locating peaks between samples that exhibited significant differences in concentration. The aim here was to reduce the amount of data required to be resolved and quantified to only those peaks that were of interest. This would then reduce the time required to analyze large, complex samples by eliminating the need to first quantify all peaks in a given sample for many different samples. Both the similarity index (SI) method and the Fisher ratio (FR) method were found to fulfill this requirement in a rapid means of screening fifteen wine samples.

Title: Electronic Collections of Solved Problems in Physics - Alternating current Author: Michala Pfefrčková Department: Department of Physics Education Supervisor: RNDr. Zdeňka Koupilová, Ph.D. Supervisor's e-mail address: zdenka.koupilova@mff.cuni.cz The main aim of this diploma thesis was to prepare a set of specialized tasks in Physics. These tasks are supposed to contain comprising structured hints leading to solution of the given examples. The set is implemented in the e-collection posted on http://fyzikalniulohy.cz. This set includes 25 tasks mostly targeted on high schools students. It supplies them with additional tasks for effective study suitable even for university students, starters, as a revision. The other part of the thesis contains a syllabus of alternating current study and the organization of the tasks how to use them to illustrate clearly the particular physical terms. Keywords: alternating current, structured tasks, e-collection, syllabus

The goal of this thesis is to develop a DSGE model that accounts for the key business cycle properties of the Czech labor market. We used standard New Keynesian framework for monetary policy analysis and incorporated an elaborated labor market setup with equi- librium wage derived via an alternating offer bargaining protocol originally proposed by Rubinstein (1982) and follow the work of Christiano, Eichenbaum and Trabandt (2013) in the following steps. Firstly, we calibrated the closed economy model according to values suited for the Czech economy and found that the model can not only account for higher volatility of the real wage and unemployment, but can also explain the contemporaneous rise of both wages and employment after an expansionary shock in the economy, so called Shimer puzzle (Shimer, 2005a). Secondly, we demonstrated that the alternating offer bar- gaining sharing rule outperforms the Nash sharing rule under assumption of using the hiring costs in our framework (more so while using search costs) and therefore is better suited for use in larger scale models. Thirdly, we concluded that after estimating the labor market parameters using the Czech data, our model disproved the relatively low values linked to the probabilities of unsuccessful bargaining and job destruction. JEL...