Diploma thesis deals with creation of laboratory exercises in ns-3 environment. Each one of three exercises consists of theoretical introduction and instructions to carry out the simulation. The first exercise´s topic is routing protocol BGP. The second exercise is focused on transport protocols TCP, UDP, SCTP. In the last exercise, the basic network devices and topologies are simulated. The ARP and RIPv2 protocols are simulated as well.

The Message Passing Interface (MPI) standard defines virtual topologies that can be applied to systems of cooperating processes. Among issues regarding a more convenient namespace this may be used to optimize the placement of MPI processes in order to reduce communication time. That means, the processes with their main communication paths represent a graph that has to be cost efficiently mapped onto the graph representing the actual communication network. In this context, this work analyses and compares state-of-the-art task mapping strategies with respect to running time and their quality of solutions to the MPI mapping problem. In particular, the focus is on generic strategies that can be used for arbitrary process/network topologies although, here, the topologies of interest are regular ones, where the number of processes is greater than the number of processors in the underlying physical network. Additionally, different measures of mapping quality are discussed and a close correspondence between the most appropriate, the weighted edge cut, and program execution time is shown. In order to investigate how mapping quality affects MPI program execution time, some mapping strategies have been incorporated into Open MPI. Finally, benchmark results prove that optimized process-to-processor mappings can improve program execution time by up to 60%, compared to the default mapping in many MPI implementations (linear mapping). The findings in this work can serve as reference not only for MPI implementors, but also for researchers investigating static process-to-processor mappings, in general.

I present a new approach to evolutionary search called novelty search, wherein only behavioral novelty is rewarded, thereby abstracting evolution as a search for novel forms. This new approach contrasts with the traditional approach of rewarding progress towards the objective through an objective function. Although they are designed to light a path to the objective, objective functions can instead deceive search into converging to dead ends called local optima. As a significant problem in evolutionary computation, deception has inspired many techniques designed to mitigate it. However, nearly all such methods are still ultimately susceptible to deceptive local optima because they still measure progress with respect to the objective, which this dissertation will show is often a broken compass. Furthermore, although novelty search completely abandons the objective, it counterintuitively often outperforms methods that search directly for the objective in deceptive tasks and can induce evolutionary dynamics closer in spirit to natural evolution. The main contributions are to (1) introduce novelty search, an example of an effective search method that is not guided by actively measuring or encouraging objective progress; (2) validate novelty search by applying it to biped locomotion; (3) demonstrate novelty search’s benefits for evolvability (i.e. the ability of an organism to further evolve) in a variety of domains; (4) introduce an extension of novelty search called minimal criteria novelty search that brings a new abstraction of natural evolution to evolutionary computation (i.e. evolution as a search for many ways of iii meeting the minimal criteria of life); (5) present a second extension of novelty search called novelty search with local competition that abstracts evolution instead as a process driven towards diversity with competition playing a subservient role; and (6) evolve a diversity of functional virtual creatures in a single run as a culminating application of novelty search with local competition. Overall these contributions establish novelty search as an important new research direction for the field of evolutionary computation.

This dissertation aims at designing a three-phase voltage source inverter based on the SiC devices and mainly the SiC-MOSFET. The designed inverter offers a possibility to drive the power inverter with a very high efficiency, which can reach up to 99% for 16 kW rated power. The design is dedicated to the electric vehicle application, and it aims at • Providing a comparative study on some of the current discrete SiC devices in terms of the total losses and the thermal conductivity. In addition, a behavioral study of the effective channel mobility with temperature variation in the SiC MOSFET will be investigated. • Designing a gate driver which fits with the driving requirements of the SiC-MOSFET and provides a trade-off between the switching losses and the EMI behavior. • Designing a three-phase voltage source inverter with 16 kW rated power; the design includes minimizing the inverter losses and extracts the EMI model of the power inverter by considering the effects of the parasitic parameters; moreover a short guideline for selecting the heat-sink based on the static network is introduced. • Proposing a new and simplified carried-based PWM, this will reduce the harmonics in the output waveforms and enhance the utilization of the DC-link voltage. • Proposing a new strategy for compensating the dead-time effect in carrier based-PWM and to find out the proper dead-time level in VSI based on SiC –MOSFET. • Designing faults diagnosis and protection circuits in order to protect the power inverter from the common faults; overcurrent, short-circuit, overvoltage, and overtemperature faults.

Dans cette thèse, les recherches ont été menées à des niveaux d'abstraction différents pour optimiser le fonctionnement du modulateur ΣΔ passe-haut (PH). Une approche « top-down » est adoptée pour atteindre cet objectif. Au niveau de l'architecture du récepteur RF, le nouvellement créé récepteur Fs/2 est sélectionné pour sa grande compatibilité avec modulateur ΣΔ PH comparé aux architectures de réception: zéro-IF et faible-IF. Après avoir défini la topologie du récepteur, l'architecture du modulateur ΣΔ est adressée. Nous proposons une nouvelle architecture du deuxième ordre dont la fonction de transfert du signal est unitaire. Elle est plus avantageuse que d'autres topologies en termes de complexité et de performance. Puisque le modulateur de second ordre est incapable de fournir les performances requises, les structures en cascade ou MASH pour l'opération PH sont explorées. La topologie GMSCL (Generalized Multi-Stage Closed Loop) est choisie et une technique récemment proposée est appliquée pour linéariser le CNA de retour. En plus, cette technique augmente la plage dynamique du convertisseur. Ensuite, après une analyse comparative approfondie, le meilleur filtre HP est choisie pour ce modulateur. Il a les avantages d'avoir une basse consommation, une superficie réduite et un bruit moins important. Enfin, l'architecture GMSCL PH proposée est validée en CMOS 65nm. Les applications visées sont l'UMTS avec 3.84MHz bande de conversion à 80 dB de la plage dynamique et WiMAX avec 25MHz de bande passante à 52dB de dynamique.

Diese Arbeit befasst sich mit der Entwicklung einer Theorie bedingter Mengen. Bedingte Mengenlehre ist reich genug um einen bedingten mathematischen Diskurs zu führen, dessen Möglichkeit wir durch die Konstruktion einer bedingten Topologielehre und bedingter reeller Analysis aufzeigen. Wir beweisen die bedingte Version folgender Sätze: Ultrafilterlemma, Tychonoff, Borel-Lebesgue, Heine-Borel, Bolzano-Weierstraß, und das Gaplemma von Debreu. Darüberhinaus beweisen wir die bedingte Version derjenigen Resultate der klassischen Mathematik, die in den Beweisen dieser Sätze benötigt werden, beginnend mit der Mengenlehre. Wir diskutieren die Verbindung von bedingter Mengenlehre zur Garben-, Topos- und L0-Theorie. / In this thesis, we develop a theory of conditional sets. Conditional set theory is sufficiently rich in order to allow for a conditional mathematical reasoning, the possibility of which we demonstrate by constructing a conditional general topology and a conditional real analysis. We prove the conditional version of the following theorems: Ultrafilter Lemma, Tychonoff, Borel-Lebesgue, Heine-Borel, Bolzano-Weierstraß, and Debreu’s Gap Lemma. Moreover, we prove the conditional version of those results in classical mathematics which are needed in the proofs of these theorems, starting from set theory. We discuss the connection of conditional set theory to sheaf, topos and L0-theory.

L'expansion des services en ligne, l'avènement du big data, favorisé par l'internet des objets et les terminaux mobiles, a entraîné une croissance exponentielle du nombre de centres de données qui fournissent des divers services de cloud computing. Par conséquent, la topologie du centre de données est considérée comme un facteur d'influence sur la performance du centre de données. En effet, les topologies des centres de données devraient offrir une latence faible, une longueur de chemin moyenne réduite avec une bande passante élevée. Ces exigences augmentent la consommation énergétique dans les centres de données. Dans cette dissertation, différentes solutions ont été proposées pour surmonter ces problèmes. Tout d'abord, nous proposons une nouvelle topologie appelée LCT (Linked Cluster Topology) qui augmente le nombre de nœuds, améliore la connexion réseau et optimise le routage des données pour avoir une faible latence réseau. Une nouvelle topologie appelée VacoNet (Variable connexion Network) a été également présentée. VacoNet offre un nouveau algorithme qui définit le exact nombre de port par commutateur pour connecter le nombre de serveurs requis tout en réduisant l'énergie consommée et les matériaux inutilisés (câbles, commutateurs). En outre, nous _étudions une nouvelle technique pour optimiser la consumation d'énergie aux centres de données. Cette technique peut périodiquement estimer la matrice de trafic et gérer l'_état des ports de serveurs tout en maintenant le centre de données entièrement connecté. La technique proposée prend en considération le trafic réseau dans la décision de gestion des ports. / Data centers (DC) are being built around the world to provide various cloud computing services. One of the fundamental challenges of existing DC is to design a network that interconnects massive number of nodes (servers)1 while reducing DC' cost and energy consumption. Several solutions have been proposed (e.g. FatTree, DCell and BCube), but they either scale too fast (i.e., double exponentially) or too slow. Effcient DC topologies should incorporate high scalability, low latency, low Average Path Length (APL), high Aggregated Bottleneck Throughput (ABT) and low cost and energy consumption. Therefore, in this dissertation, different solutions have been proposed to overcome these problems. First, we propose a novel DC topology called LCT (Linked Cluster Topology) as a new solution for building scalable and cost effective DC networking infrastructures. The proposed topology reduces the number of redundant connections between clusters of nodes, while increasing the numbers of nodes without affecting the network bisection bandwidth. Furthermore, in order to reduce the DCs cost and energy consumption, we propose first a new static energy saving topology called VacoNet (Variable Connection Network) that connects the needed number of servers while reducing the unused materials (cables, switches). Also, we propose a new approach that exploits the correlation in time of internode communication and some topological features to maximize energy saving without too much impacting the average path length.

The main goal of this project was an optimization of DC-DC converter design from company Meatest with regards to its efficiency, minimalizing power loses and radiated electromagnetic inference, while maintaining its price on reasonable level. The first part of this paper is introduction to the most common converter topologies. In the second part, design and optimization of converter are discussed. The third part is about measurement automatization in Simple. Measurements of converter prototype can be found in fourth part.

Cette thèse propose une nouvelle méthode pour fournir une connexion réseau à des véhicules au cours de trajets prédéterminés (trains, métros, autobus urbains, etc.). La communication entre le véhicule et l'infrastructure réseau est basée uniquement sur la technologie WiFi. Les contributions de ce travail sont d'une part la conception d'une méthode pour réaliser le handover horizontal (entre bornes WiFi), et d'autre part la modélisation et l'analyse de topologies pour le réseau d'infrastructure (réseau backbone plus réseau d'accès WiFi) déployé sur la trajectoire du véhicule. Dans une première partie, nous proposons une méthode, appelée Spiderman Handover, pour réaliser le handover horizontal d'un réseau en mouvement (embarqué dans le véhicule) et une procédure de mise à jour des informations de routage (couche 2 OSI) lors du handover. Nous évaluons notre proposition par simulation et validons nos résultats par des mesures expérimentales. Dans une deuxième partie, nous étudions théoriquement les paramètres de plusieurs familles de topologies du type Chordal pour le réseau backbone construit sur un réseau d'accès linéaire. A partir de la comparaison de ces paramètres, nous proposons une topologie backbone issue de la combinaison de deux topologies Chordal. Cette topologie fournit un bon compromis entre coût du déploiement, nombre de sauts nécessaires pour atteindre la passerelle du réseau et résilience raisonnable. Enfin, nous évaluons l'intégration de la topologie proposée pour le réseau d'infrastructure avec le système handover par des simulations. Les résultats présentés suggèrent que l'algorithme de handover proposé fonctionne correctement sur le réseau d'infrastructure proposé. Cela permet la garantie d'une connexion continue aux passagers à bord des trains, métros ou autobus urbains.

Switched mode power supplies (SMPS) are being extensively used in most power conversion processes. The analysis, design and modeling processes of hard-switched converters are mature, where the switching frequency was limited to a few 10's of kHz. The present direction of evolution m SMPS is towards higher efficiency and higher power density. These twin objectives demand high switching frequency and low overall losses. Soft switching results in practically zero switching losses and extends the switching frequency to 100's of kHz and beyond. This thesis presents novel variants of push-pull and half-bridge DC-DC converters with soft switching properties. The proposed topology uses two additional switches and two diodes. The additional switches introduce freewheeling intervals m the circuit and enable loss-less switching. Switch stress, control and small signal model are similar to hard-switched PWM converter. Synchronous rectifiers are used in the ZVS push-pull converter to achieve high efficiency. It is interesting to see that the drives for the synchronous rectifier device are practically the same as the additional switches. The contributions made in this thesis are 1) Idealized analysis and design methodology for the proposed converters. 2) Validation of the design through circuit simulation as well as prototypes - a 300kHz, 200W push-pull converter and a 300kHz, 640W half-bridge converter. 3) Closed loop control design for desired bandwidth and accuracy Verification of loop gain through network analyzer instrumental for the same The loop gain bandwidth achieved is about 30kHz for the push-pull converter and 20kHz for half-bridge converter. An appendix has been devoted to explain the use of network analyzer. Characterization of coil, transformer and capacitor are explained in detail. Measurement techniques for measuring the small signal parameters of power supply are also explained in the appendix.