La thèse est dédiée au problème de la stéréophotométrie non-Lambertienne sans connaissance a priori sur les conditions d’illumination et son application aux images de boîte de Pétri. Pour obtenir une bonne reconstruction de surfaces non-Lambertiennes, il est proposé de traiter une séquence d’entrée en deux étapes: premièrement il faut supprimer les effets spéculaires et obtenir ainsi des images de surface ’pseudo-Lambertienne’. Ensuite dans une deuxième étape à partir de ces images une reconstruction stéréophotométrique Lambertienne sans aucune information préalable sur les directions d’illumination est effectuée. Dans ce travail nous proposons deux méthodes originales respectivement pour la suppression de spécularités et la reconstruction de surface sans information a priori. Les méthodes proposées sont appliquées pour la caractérisation des colonies microbiennes.La spécularités est un effet optique lié à la nature physique complexe des objets. Il est utile pour la perception humaine des objets 3D mais il gêne le processus de traitement automatique d’images. Pour pouvoir appliquer le modèle Lambertien à la stéréophotométrie, les spécularités doivent être supprimées des images d’entrée. Nous proposons donc une méthode originale pour la correction des zones spéculaires adaptée pour une reconstruction ultérieure. L’algorithme proposé est capable de détecter les spécularités comme des valeurs anormalement élevées d’intensité dans une image de la séquence d’entrée, et de les corriger en utilisant les informations des autres images de la séquence et une fonction de correction continue. Cette méthode permet de faire la suppression des spécularités en préservant toutes les autres particularités de distribution de lumière qui sont importantes pour la reconstruction de surface.Après nous proposons une technique de reconstruction stéréophotométrique de surface Lambertienne sans connaissance a priori sur l’illumination. Le modèle mis en œuvre consiste en quatre composantes, deux composantes (albédo et normales) permettent de d´écrire des propriétés de surface et deux autres (intensités des sources de lumière et leurs directions) décrivent illumination. L’algorithme proposé de reconstruction utilise le principe de l’optimisation alternée. Chaque composante du modèle est trouvée itérativement en fixant toutes les variables sauf une et en appliquant des contraintes de structures, valeurs et qualité pour la fonction d’optimisation. Un schéma original de résolution permet de séparer les différents types d’information inclus dans les images d’entrée. Grâce à cette factorisation de matrices, la reconstruction de surface est faite sans connaissance préalable sur les directions de lumière et les propriétés de l’objet reconstruit. L’applicabilité de l’algorithme est prouvée pour des donnés artificielles et des images de bases publiques pour lesquelles la vérité terrain sur les surfaces des objets est disponible.La dernière partie de la thèse est dédiée à l’application de la chaine complète proposée pour le traitement d’images de boîte de Pétri. Ces images sont obtenues en utilisant les sources de lumières complexes qui sont supposées être inconnues pour le processus de reconstruction. L’évaluation de surfaces de colonies microbiennes s’est révélée être une étape importante pour l'analyse visuelle et automatique des colonies. La chaine proposée est efficace pour ce type de données et permet de compléter les informations d'images par de la surface 3D. / The PhD thesis work is dedicated to the problem of uncalibrated non-Lambertian photometric stereo surface reconstruction. The proposed approach consists in two phases: first we correct images of the input sequence from specularities in order to obtain images of pseudo-Lambertian surfaces, and then realize Lambertian photometric stereo reconstruction. In this work we proposed two original methods, respectively, for specularity correction and surface reconstruction with no prior information neither on light sources nor on surface properties. We apply the novel processing to Petri dish images for microbial colonies surface reconstruction.Specularity is an optical effect of a complex physical nature. This effect is useful for human 3D objects perception but it affects automated image processing. In order to be able to apply the Lambertian photometric stereo model, specularities should be removed from the input images. We propose an original method for specular zones correction adapted to estimation of pseudo-Lambertian surface images and further reconstruction. This algorithm is able to detect specularities as abnormally elevated pixel intensity values in an image of the input sequence and to correct the found zones using information from all other images of the sequence and a specific continuous correcting function. This method allows removing specularities while still preserving all other particularities of shading important for the further surface reconstruction.We then propose an original stereo photometric method for Lambertian surface reconstruction with no prior on illuminations. The implemented photometric stereo model consists of four components, two of them (albedo and normals) describe surface properties and the others (light sources intensities and directions) describe illumination. The proposed algorithm of the photometric stereo reconstruction uses the alternating optimization principle. Each model component is found iteratively fixing all variables but one and applying value and quality constraints for the optimization function. The original scheme of resolution allows separating of different information types included in input images. Thanks to such matrix factorization, the surface reconstruction is made with no prior information on lighting directions and the reconstructed objects properties. The applicability of the algorithm is proved using artificially created and open data-sets for which the ground truth information is available.The last part of the thesis is dedicated to the application of the proposed uncalibrated non- Lambertian photometric stereo approach to the Petri dish images. Images are obtained using illuminating sources which are supposed to be unknown for the reconstruction process. Moreover, the reconstructed microbial colonies are very diverse, generally have small size, can be Lambertian or not, and their surface properties are not defined in advance. The results of reconstruction for such complex real-world data add value and importance to the developed approach.

[pt] Em meados do século XIX, G. Boole mostrou que a transformação x -> x − 1/x, definida em R − {0}, preserva a medida de Lebesgue (Ble). Mais de um século depois, R. Adler e B.Weiss mostraram que essa aplicação, chamada de transformação de Boole, é, de fato, ergódica com respeito à medida de Lebesgue (Adl). Nesse trabalho, apresentaremos o conceito de sistemas alternantes, definido recentemente por S. Muñoz (Mun), que consiste numa grande classe de aplicações na reta que generaliza a transformação de Boole e que torna possível uma análise abrangente de propriedades como transitividade robusta e ergodicidade. Para mostrar que, sob certas condições, sistemas alternantes são ergódicos com relação à medida de Lebesgue, mostraremos, usando o Teorema do Folclore, que a transformação induzida do sistema alternante é ergódica. / [en] In the middle of the 19th century, G. Boole proved that the transformation x -> x − 1/x, defined on R − {0}, is a Lebesgue measure preserving transformation (Ble). Over one hundred years later, R. Adler and B.Weiss proved that this map, called Boole`s map, is, in fact, ergodic with respect to the Lebesgue measure (Adl). In this work, we present the notion of alternating systems, recently introduced by S. Mu`noz (Mun), which is a large class of functions on the real line that generalizes the Boole`s map and allows us to make a wide analysis on certain properties such as robust transitivity and ergodicity. In order to show that, under certain conditions, alternating systems are ergodic with respect to the Lebesgue measure, we show, using the Folklore Theorem, that the induced transformation of an alternating system is ergodic.

In dieser Arbeit wird ein neuer Ansatz für die Analyse von Profile Maximierungsschätzern präsentiert. Es werden die Ergebnisse von Spokoiny (2011) verfeinert und angepasst für die Schätzung von Komponenten von endlich dimensionalen Parametern mittels der Maximierung eines Kriteriumfunktionals. Dabei werden Versionen des Wilks Phänomens und der Fisher-Erweiterung für endliche Stichproben hergeleitet und die dafür kritische Relation der Parameterdimension zum Stichprobenumfang gekennzeichnet für den Fall von identisch unabhängig verteilten Beobachtungen und eines hinreichend glatten Funktionals. Die Ergebnisse werden ausgeweitet für die Behandlung von Parametern in unendlich dimensionalen Hilberträumen. Dabei wir die Sieve-Methode von Grenander (1981) verwendet. Der Sieve-Bias wird durch übliche Regularitätsannahmen an den Parameter und das Funktional kontrolliert. Es wird jedoch keine Basis benötigt, die orthogonal in dem vom Model induzierten Skalarprodukt ist. Weitere Hauptresultate sind zwei Konvergenzaussagen für die alternierende Maximisierungsprozedur zur approximation des Profile-Schätzers. Alle Resultate werden anhand der Analyse der Projection Pursuit Prozedur von Friendman (1981) veranschaulicht. Die Verwendung von Daubechies-Wavelets erlaubt es unter natürlichen und üblichen Annahmen alle theoretischen Resultate der Arbeit anzuwenden. / This thesis presents a new approach to analyze profile M-Estimators for finite samples. The results of Spokoiny (2011) are refined and adapted to the estimation of components of a finite dimensional parameter using the maximization of a criterion functional. A finite sample versions of the Wilks phenomenon and Fisher expansion are obtained and the critical ratio of parameter dimension to sample size is derived in the setting of i.i.d. samples and a smooth criterion functional. The results are extended to parameters in infinite dimensional Hilbert spaces using the sieve approach of Grenander (1981). The sieve bias is controlled via common regularity assumptions on the parameter and functional. But our results do not rely on an orthogonal basis in the inner product induced by the model. Furthermore the thesis presents two convergence results for the alternating maximization procedure. All results are exemplified in an application to the Projection Pursuit Procedure of Friendman (1981). Under a set of natural and common assumptions all theoretical results can be applied using Daubechies wavelets.

Cette thèse se divise en 2 grandes parties indépendantes ; la première traitant des nombres de Jacobi-Stirling, la seconde abordant les nombres d’Entringer. La première partie introduit les nombres de Jacobi-Stirling de seconde et de première espèce comme coefficients algébriques dans des relations polynomiales. Nous donnons des interprétations combinatoires de ces nombres, en termes de partitions d’ensembles et de quasi-permutations pour les nombres de seconde espèce, et en termes de permutations pour les nombres de première espèce. Nous étudions également les fonctions génératrices diagonales de ces familles de nombres, ainsi qu’une de leur généralisation sur le modèle des r-nombres de Stirling. La seconde partie introduit les nombres d’Entringer à l’aide de leur interprétation en termes de permutations alternantes. Nous étudions les différentes formules de récurrence vérifiées par ces nombres et généralisons ces résultats à l’aide d’un q-analogue utilisant la statistique d’inversion. Nous verrons également que ces résultats peuvent être étendus à des permutations de forme donnée quelconque. Enfin, nous définissons la notion de famille d’Entringer, et établissons des bijections entre certaines de ces familles. En particulier, nous établissons une bijection reliant les permutations alternantes de premier terme fixé, aux arbres binaires croissants dont l’extrémité du chemin minimal est fixée. / This thesis is constructed in two main independant parts ; the first one dealing with the numbers of Jacobi-Stirling, the second one tackling the numbers of Entringer. The first part introduces the numbers of Jacobi-Stirling of the second kind and of the first kind, as algebraic coefficients in some polynomial relations. We give some combinatorial interpretations of these numbers, in terms of set partitions and quasi-permutations for the numbers of the second kind, and in terms of permutations for the numbers of the first kind. We also study the diagonal generating functions of these sequences of numbers, and one of their generalization based on the model of r-Stirling numbers. The second part introduces the numbers of Entringer with their interpretation in terms of alternating permutations. We study the different recurrences formulas satisfied by these numbers, and refine these results with a q-analogue using the inversion statistic. We also note that these results can be extend to permutations with any fixed shape. Finally, we define the notion of Entringer family, and provide bijections between some of these families. In particular, we establish a bijection between the alternating permutations with fixed given value, and the binary increasing trees such that the end-point of the minimal path is fixed.

Orientador: Prof. Dr. Claudionor Francisco do Nascimento / Dissertação (mestrado) - Universidade Federal do ABC, Programa de Pós-Graduação em Engenharia Elétrica, 2014. / Os sistemas de distribuição de energia elétrica, de um modo geral, são radiais. Estes sistemas podem possuir problemas de qualidade da energia elétrica em suas barras, tais como os desequilíbrios de tensão e de corrente. Ademais, as redes de distribuição podem conter uma grande quantidade de cargas monofásicas e trifásicas desequilibradas, indutivas e não lineares, o que pode resultar nos seguintes problemas: baixo fator de potência, desequilíbrio de tensão e distorção harmônica. Nesse sentido, devido à dinâmica destas cargas e a ocorrência de fenômenos, como afundamento de tensão por partidas de grandes motores e curtos-circuitos, há a necessidade de solução destas anormalidades, com respostas rápidas de estabilização. De maneira a atender a esta necessidade, os resultados das recentes pesquisas baseadas na eletrônica de potência têm proporcionado a utilização de equipamentos capazes de trabalhar em sistemas de potência de alta tensão. Esse avanço permite aplicações de dispositivos FACTS (Flexible Alternating Current Transmission Systems) nas operações de flexibilidade e mitigação de problemas comuns às redes de energia elétrica de transmissão e de distribuição, melhorando, assim, a qualidade da energia elétrica, o que aumenta a confiabilidade destes sistemas. Com este propósito, o presente trabalho tem como objetivo principal o estudo e a modelagem de um DSTATCOM (Distribution Static Compensator) em um sistema de distribuição de energia elétrica com variações de tensão, avaliando os possíveis benefícios proporcionados a este sistema. Os resultados de simulação foram obtidos com o auxílio do software MatLab/Simuling. / Distribution systems of electric power, in general, are radial. These systems have power quality problems in their power bars, such as the voltage variations. Moreover, the distribution networks contain a large amount of single-phase and three-phase unbalanced loads, inductive and non-linear, which may result in the following problems: low power factor, voltage unbalance, and harmonic distortion. Accordingly, due to the dynamic loads and the occurrence of these phenomena, such as voltage sag matches by large motors and short circuits, there is a need for solution of these abnormalities, with responsive stabilization. In order to meet this need, the results of recent research based on power electronics have provided the use of equipment to work on systems of high voltage power. This advancement allows applications FACTS devices (Flexible Alternating Current Transmission Systems) flexibility in operations and mitigation of problems common to the networks of electricity transmission and distribution, thus improving the quality of electric power, which increases the reliability of these systems. For this purpose, the present work has as main objective the study and modeling of a DSTATCOM (Distribution Static Compensator) in a system of electricity distribution, evaluating the possible benefits provided to the electric power system. The simulation results were obtained with the aid of software Matlab/Simuling. The effectiveness of the work has been proven since the DSTATCOM installed, the distribution network operated within established standards.

Cette thèse explore l’utilisation des modèles de contours déformables pour la segmentation basée sur la forme des images médicales. Nous apportons des contributions sur deux fronts: dans le problème de l’apprentissage statistique, où le modèle est formé à partir d’un ensemble d’images annotées, et le problème de l’inférence, dont le but est de segmenter une image étant donnée un modèle. Nous démontrons le mérite de nos techniques sur une grande base d’images à rayons X, où nous obtenons des améliorations systématiques et des accélérations par rapport à la méthode de l’état de l’art. Concernant l’apprentissage, nous formulons la formation de la fonction de score des modèles de contours déformables en un problème de prédiction structurée à grande marge et construisons une fonction d’apprentissage qui vise à donner le plus haut score à la configuration vérité-terrain. Nous intégrons une fonction de perte adaptée à la prédiction structurée pour les modèles de contours déformables. En particulier, nous considérons l’apprentissage avec la mesure de performance consistant en la distance moyenne entre contours, comme une fonction de perte. L’utilisation de cette fonction de perte au cours de l’apprentissage revient à classer chaque contour candidat selon sa distance moyenne du contour vérité-terrain. Notre apprentissage des modèles de contours déformables en utilisant la prédiction structurée avec la fonction zéro-un de perte surpasse la méthode [Seghers et al. 2007] de référence sur la base d’images médicales considérée [Shiraishi et al. 2000, van Ginneken et al. 2006]. Nous démontrons que l’apprentissage avec la fonction de perte de distance moyenne entre contours améliore encore plus les résultats produits avec l’apprentissage utilisant la fonction zéro-un de perte et ce d’une quantité statistiquement significative.Concernant l’inférence, nous proposons des solveurs efficaces et adaptés aux problèmes combinatoires à variables spatiales discrétisées. Nos contributions sont triples: d’abord, nous considérons le problème d’inférence pour des modèles graphiques qui contiennent des boucles, ne faisant aucune hypothèse sur la topologie du graphe sous-jacent. Nous utilisons un algorithme de décomposition-coordination efficace pour résoudre le problème d’optimisation résultant: nous décomposons le graphe du modèle en un ensemble de sous-graphes en forme de chaines ouvertes. Nous employons la Méthode de direction alternée des multiplicateurs (ADMM) pour réparer les incohérences des solutions individuelles. Même si ADMM est une méthode d’inférence approximative, nous montrons empiriquement que notre implémentation fournit une solution exacte pour les exemples considérés. Deuxièmement, nous accélérons l’optimisation des modèles graphiques en forme de chaîne en utilisant l’algorithme de recherche hiérarchique A* [Felzenszwalb & Mcallester 2007] couplé avec les techniques d’élagage développés dans [Kokkinos 2011a]. Nous réalisons une accélération de 10 fois en moyenne par rapport à l’état de l’art qui est basé sur la programmation dynamique (DP) couplé avec les transformées de distances généralisées [Felzenszwalb & Huttenlocher 2004]. Troisièmement, nous intégrons A* dans le schéma d’ADMM pour garantir une optimisation efficace des sous-problèmes en forme de chaine. En outre, l’algorithme résultant est adapté pour résoudre les problèmes d’inférence augmentée par une fonction de perte qui se pose lors de l’apprentissage de prédiction des structure, et est donc utilisé lors de l’apprentissage et de l’inférence. [...] / This thesis explores the use of discriminatively trained deformable contour models (DCMs) for shape-based segmentation in medical images. We make contributions in two fronts: in the learning problem, where the model is trained from a set of annotated images, and in the inference problem, whose aim is to segment an image given a model. We demonstrate the merit of our techniques in a large X-Ray image segmentation benchmark, where we obtain systematic improvements in accuracy and speedups over the current state-of-the-art. For learning, we formulate training the DCM scoring function as large-margin structured prediction and construct a training objective that aims at giving the highest score to the ground-truth contour configuration. We incorporate a loss function adapted to DCM-based structured prediction. In particular, we consider training with the Mean Contour Distance (MCD) performance measure. Using this loss function during training amounts to scoring each candidate contour according to its Mean Contour Distance to the ground truth configuration. Training DCMs using structured prediction with the standard zero-one loss already outperforms the current state-of-the-art method [Seghers et al. 2007] on the considered medical benchmark [Shiraishi et al. 2000, van Ginneken et al. 2006]. We demonstrate that training with the MCD structured loss further improves over the generic zero-one loss results by a statistically significant amount. For inference, we propose efficient solvers adapted to combinatorial problems with discretized spatial variables. Our contributions are three-fold:first, we consider inference for loopy graphical models, making no assumption about the underlying graph topology. We use an efficient decomposition-coordination algorithm to solve the resulting optimization problem: we decompose the model’s graph into a set of open, chain-structured graphs. We employ the Alternating Direction Method of Multipliers (ADMM) to fix the potential inconsistencies of the individual solutions. Even-though ADMMis an approximate inference scheme, we show empirically that our implementation delivers the exact solution for the considered examples. Second,we accelerate optimization of chain-structured graphical models by using the Hierarchical A∗ search algorithm of [Felzenszwalb & Mcallester 2007] couple dwith the pruning techniques developed in [Kokkinos 2011a]. We achieve a one order of magnitude speedup in average over the state-of-the-art technique based on Dynamic Programming (DP) coupled with Generalized DistanceTransforms (GDTs) [Felzenszwalb & Huttenlocher 2004]. Third, we incorporate the Hierarchical A∗ algorithm in the ADMM scheme to guarantee an efficient optimization of the underlying chain structured subproblems. The resulting algorithm is naturally adapted to solve the loss-augmented inference problem in structured prediction learning, and hence is used during training and inference. In Appendix A, we consider the case of 3D data and we develop an efficientmethod to find the mode of a 3D kernel density distribution. Our algorithm has guaranteed convergence to the global optimum, and scales logarithmically in the volume size by virtue of recursively subdividing the search space. We use this method to rapidly initialize 3D brain tumor segmentation where we demonstrate substantial acceleration with respect to a standard mean-shift implementation. In Appendix B, we describe in more details our extension of the Hierarchical A∗ search algorithm of [Felzenszwalb & Mcallester 2007] to inference on chain-structured graphs.

<p>The question about how to determine the rank of a tensor has been widely studied in the literature. However the analytical methods to compute the decomposition of tensors have not been so much developed even for low-rank tensors.</p><p>In this report we present analytical methods for finding real and complex PARAFAC decompositions of 2 x 2 x 2 tensors before computing the actual rank of the tensor.</p><p>These methods are also implemented in MATLAB.</p><p>We also consider the question of how best lower-rank approximation gives rise to problems of degeneracy, and give some analytical explanations for these issues.</p>

The question about how to determine the rank of a tensor has been widely studied in the literature. However the analytical methods to compute the decomposition of tensors have not been so much developed even for low-rank tensors. In this report we present analytical methods for finding real and complex PARAFAC decompositions of 2 x 2 x 2 tensors before computing the actual rank of the tensor. These methods are also implemented in MATLAB. We also consider the question of how best lower-rank approximation gives rise to problems of degeneracy, and give some analytical explanations for these issues.

En esta Tesis ha sido analizado el control de la màquina sincrónica de rotor bobinado actuando en isla. Para esta configuración, la velocidad mecànica determina la frecuencia, y la tensión de rotor se utiliza para fijar la amplitud de la tensión de estator. Debido a que la constante de tiempo eléctrica es mucho más ràpida comparada con la constante de tiempo mecánica, la velocidad mecánica fue considerada constante y externamente regulada y la investigación se enfocó en la regulación de la amplitud de la tensión de estator.Cuatro diferentes controladores basados en técnicas de modos deslizantes fueron diseñados en el marco de referencia dq. Las leyes de control obtenidas regulan la amplitud de la tensión de estator independientemte del valor de la carga. Adicionalmente, sólo las medidas de tensión y posición del rotor (para calcular la transformada dq) son necesarias. La estabilidad de los puntos de equilibrio obtenidos fueron probados al menos utilizando anàlisis de pequeña señal.Se realizó la validación por simulación y experimental de cada controlador en diferentes escenarios. Los resultados obtenidos validan los diseños y muestran las principales ventajas y desventajas de el sistema en lazo cerrado.El capítulo 2 cubre los problemas de modelado de la màquina sincrónica de rotor bobinado. Partiendo de las ecuaciones trifásicas generales, y utilizando la transformada de Park, se encontraron el modelo en dq del generador sincrónico de rotor bobinado (WRSG) en isla, alimentando tanto carga resistiva como inductiva. Los puntos de equilibrio del sistema obtenido fueron analizados y calculados, luego se definió el objetivo de control. Finalmente, se obtuvieron modelos lineales aproximados y sus respectivas funciones de transferencia.Los controladores PI son los más usados en la industria porque ofrecen buen desempeño y son sencillos de implementar. En el capítulo 3, se obtuvieron las reglas de sintonización para el controlador PI, y se analizaron estos resultados con el objetivo de proponer nuevos controladores que mejoraran el desempeño de la clásica aproximación PI.El esquema de control en modos deslizantes para la WRSG conectada a una carga resistiva fue diseñado en el capítulo 4. Éste, también incluye un completo análisis de estabilidad del sistema en lazo cerrado. El capítulo 5 presenta dos diseños basados en modos deslizantes para regular la amplitud de la tensión de estator para el WRSG actuando en isla. Ambos diseños usan la componente d de la tensión de estator en la función de conmutación. El primer caso es un control anidado, donde un lazo externo PI es añadido para proveer la referencia de la componente d de la tensión. En la segunda aproximación un término integral es añadido a la superficie de conmutación.El caso de alimentar una carga inductiva es estudiado en el capítulo 6. El controlador requiere una extensión dinámica debido a que la amplitud de la tensión de estator es una salida de grado relativo cero. Como resultado, un controlador robusto, que no depende de los parámetros de la máquina ni de los valores de carga es obtenido. En el capítulo 7 los resultados de simulación y experimentales para los controladores diseñados para el WRSG actuando en isla son presentados. En primer lugar, una descripción completa del banco es presentada. Esta incluye detalles de la etapa de adquisición de datos y de la DSP utilizada. En segundo lugar, se hace la descripción del procedimiento de simulación. Luego, las simulaciones y experimentos, que contienen diferentes escenarios, con cambios de referencia y variaciones de carga para cada controlador son presentados. / The control of the stand-alone the wound rotor synchronous generator has been analyzed in this dissertation. For this islanded configuration, the mechanical speed determines the frequency, and the rotor voltage is used to set the stator voltage amplitude. Due to the electrical time constant is so fast compared with the mechanical time constants, the mechanical speed was considered constant and externally regulated and the research was focused on the stator voltage amplitude regulation.Four different controllers based on sliding mode control techniques were designed in the dq reference frame. The obtained control laws regulate the stator voltage amplitude irrespectively of the load value. Furthermore, only voltage and rotor position measures (to compute the dq transformation), are required. The stability of the obtained equilibrium points was proved at least using small-signal analysis. Simulation and experimental validation of each controller containing several scenarios were carried out. The obtained results validate the designs and show the main advantages and disadvantages of each closed loop system. Chapter 2 covers the modeling issues of the wound rotor synchronous machine. From the general three-phase dynamical equations, and using the Park transformation, the dq-model of the stand-alone wound rotor synchronous generator feeding both a resistive and an inductive load are obtained. Equilibrium points of the obtained systems are analyzed and, after defining the control objective, the desired equilibrium points are computed.Finally, linear approximated models are obtained and their transfer functions are also presented.PI controllers are the most used in the industry because they offers good performance and are easily implementables. In Chapter 3 we obtain the tuning rule for the PI controller, and we analyze these results in order to propose new controllers which improve the classic PI approach.The sliding mode control scheme for the WRSG connected to a resistive load is designed in Chapter 4. It also includes a complete stability analysis of the closed loop system. Chapter 5 presents two sliding mode designs to regulate the stator voltage amplitude for a stand-alone wound rotor synchronous generator. Both use the stator voltage d-component error in the switching function. The first case is a nested controller, where an outer PI loop is added to provide the proper d-voltage component reference. In the second approach an integral term is added to the switching function. The case of feeding an inductive load is studied in Chapter 6. The controller introduces a dynamic extension because the stator voltage amplitude is a zero relative degree output. As result, a robust controller, which neither depends on the machine parameters nor on the load values, is obtained. In Chapter 7 the simulation and the experimental results of the designed controllers for the stand-alone wound rotor synchronous generator are presented. Firstly, a complete description of the bench is provided. It also includes details of the data acquisition stage and the used DSP card. Secondly, the description of the simulation procedure is commented. Then, the simulation and experiments which contains several scenarios, with reference change and load variations evaluated for each controller are presented.

We demonstrate a new approach for fabricating alternating current driven organic electroluminescent devices using the concept of doping in organic semiconductors. Doped charge transport layers are used for generation of charge carriers within the device, hence eliminating the need for injecting charge carriers from external electrodes. The device is an organic-inorganic hybrid: We exploit the mechanical strength and chemical stability of inorganic semiconductors and combine it with better optical properties of organic materials whose emission color can be chemically tuned so that it covers the entire visible spectrum. The device consists of an organic electroluminescence (EL) layer composed of unipolar/ambipolar charge transport materials doped with organic dyes (10 wt% ) as well as molecularly doped charge generation layers enclosed between a pair of transparent insulating metal oxide layers. A transparent indium doped tin oxide (ITO) layer acts as bottom electrode for light outcoupling and Aluminium (Al) as top reflective electrode. The electrodes are for applying field across the device and to charge the device, instead of injection of charge carriers in case of direct current (DC) devices. Bright luminance of up to 5000 cd m-2 is observed when the device is driven with an alternating current (AC) bias. The luminance observed is attributed to charge carrier generation and recombination, leading to formation of excitons within the device, without injection of charge carriers through external electrodes.