• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 5
  • 3
  • 3
  • 3
  • 2
  • 1
  • Tagged with
  • 17
  • 10
  • 6
  • 6
  • 4
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

Multiterminal Video Coding: From Theory to Application

Zhang, Yifu 2012 August 1900 (has links)
Multiterminal (MT) video coding is a practical application of the MT source coding theory. For MT source coding theory, two problems associated with achievable rate regions are well investigated into in this thesis: a new sufficient condition for BT sum-rate tightness, and the sum-rate loss for quadratic Gaussian MT source coding. Practical code design for ideal Gaussian sources with quadratic distortion measure is also achieved for cases more than two sources with minor rate loss compared to theoretical limits. However, when the theory is applied to practical applications, the performance of MT video coding has been unsatisfactory due to the difficulty to explore the correlation between different camera views. In this dissertation, we present an MT video coding scheme under the H.264/AVC framework. In this scheme, depth camera information can be optionally sent to the decoder separately as another source sequence. With the help of depth information at the decoder end, inter-view correlation can be largely improved and thus so is the compression performance. With the depth information, joint estimation from decoded frames and side information at the decoder also becomes available to improve the quality of reconstructed video frames. Experimental result shows that compared to separate encoding, up to 9.53% of the bit rate can be saved by the proposed MT scheme using decoder depth information, while up to 5.65% can be saved by the scheme without depth camera information. Comparisons to joint video coding schemes are also provided.
12

Symmetric Generalized Gaussian Multiterminal Source Coding

Chang, Yameng Jr January 2018 (has links)
Consider a generalized multiterminal source coding system, where 􏱡(l choose m) 􏱢 encoders, each m observing a distinct size-m subset of l (l ≥ 2) zero-mean unit-variance symmetrically correlated Gaussian sources with correlation coefficient ρ, compress their observation in such a way that a joint decoder can reconstruct the sources within a prescribed mean squared error distortion based on the compressed data. The optimal rate- distortion performance of this system was previously known only for the two extreme cases m = l (the centralized case) and m = 1 (the distributed case), and except when ρ = 0, the centralized system can achieve strictly lower compression rates than the distributed system under all non-trivial distortion constaints. Somewhat surprisingly, it is established in the present thesis that the optimal rate-distortion preformance of the afore-described generalized multiterminal source coding system with m ≥ 2 coincides with that of the centralized system for all distortions when ρ ≤ 0 and for distortions below an explicit positive threshold (depending on m) when ρ > 0. Moreover, when ρ > 0, the minimum achievable rate of generalized multiterminal source coding subject to an arbitrary positive distortion constraint d is shown to be within a finite gap (depending on m and d) from its centralized counterpart in the large l limit except for possibly the critical distortion d = 1 − ρ. / Thesis / Master of Applied Science (MASc)
13

Dynamisk modellering av VSC-HVDC : En statisk och dynamisk modelldesign över VSC-HVDC för implementering i ARISTO / A dynamic state model design of the VSC-HVDC to be implemented in ARISTO.

Karlsson, Marcus January 2011 (has links)
This thesis treats the subject of a complete steady state and dynamic model of the VSC-HVDC covering both the AC and DC system-side of the converter. The topology of the model is recreated after the scheduled transmission line in the south of Sweden, called SydVästlänken. The topology covers both a simple two terminal connection as well as a multi-terminal one. This model is to be implemented in the power system simulation program ARISTO. The main directive of the model is operation planning and education during real-time scenarios. The model is deliberately designed as a complete and complex model but with methods of reducing it's complexity to suit the users needs at the time for implementation. Further more the author have made sure that it is a complete generic model to suit the application of the program as the technology to the day of this study are unknown. Lastly, a method of controlling the converters are presented where Droop-control take a prominent roll as the AC and DC voltage regulator.
14

Reglering av effektflöde i HVDC-system genom centraliserad och distribuerad spänningskontroll i realtid

Ahmadi, Seyedhesam, Bahmani, Mehrdad January 2019 (has links)
“High voltage direct current” (HVDC) teknologi har blivit allt viktigare teknik för att integrera förnybara energikällor i elnätet. För att styra ett sådant elsystem på bästa möjliga sätt krävs optimala kontrollstatergier både för omvandlarna och nätet. Så syftet med detta projekt är att undersöka hur olika regleringsmetoder, såsom centraliseradoch distribuerad spänningskontroll, kan påverka driften i ett 4-terminal HVDC-system. Ett optimalt effektflöde uppstår i systemet endast när likspänningen inte avviker från sitt börvärde och det uppnås genom att ha aktiv effekt regulator i varje nod i nätet. Olika scenarier som ändring av effektens börvärde och omvandlaravbrott har simulerats med hjälp av HIL-processen i realtid. Simuleringarna hjälper till att analysera hur väl dem implementerade regleringsmetoder i nodernas regulatorer hantera dessa förändringar. Resultatet ger bevis på att både centraliseradoch distruebued metoden har positiva och negativa aspekter. Fördelen med centraliserade metoden är att den ger en väldefinierad operationspunkt men den hanterar den inte svåra transienter (tex. avbrott) vilket distribuerade metoden gör.
15

Development Of An Application Specific Parallel Processing Real-Time System For MTDC System Control

Shyam, V 05 1900 (has links) (PDF)
No description available.
16

Efektivní knihovna pro práci s konečnými stromovými automaty / An Efficient Finite Tree Automata Library

Lengál, Ondřej January 2010 (has links)
Numerous computer systems use dynamic control and data structures of unbounded size. These data structures have often the character of trees or they can be encoded as trees with some additional pointers. This is exploited by some currently intensively studied techniques of formal verification that represent an infinite number of states using a finite tree automaton. However, currently there is no tree automata library implementation that would provide an efficient and flexible support for such methods. Thus the aim of this Mas- ter's Thesis is to provide such a library. The present paper first describes the theoretical background of finite tree automata and regular tree languages. Then it surveys the cur- rent implementations of tree automata libraries and studies various verification techniques, outlining requirements for the library. Representation of a finite tree automaton and algo- rithms that perform standard language operations on this representation are proposed in the next part, which is followed by description of library implementation. Through a series of experiments it is shown that the library can compete with other available tree automata libraries, in certain areas being even significantly superior to them.
17

Variantes non standards de problèmes d'optimisation combinatoire / Non-standard variants of combinatorial optimization problems

Le Bodic, Pierre 28 September 2012 (has links)
Cette thèse est composée de deux parties, chacune portant sur un sous-domaine de l'optimisation combinatoire a priori distant de l'autre. Le premier thème de recherche abordé est la programmation biniveau stochastique. Se cachent derrière ce terme deux sujets de recherche relativement peu étudiés conjointement, à savoir d'un côté la programmation stochastique, et de l'autre la programmation biniveau. La programmation mathématique (PM) regroupe un ensemble de méthodes de modélisation et de résolution, pouvant être utilisées pour traiter des problèmes pratiques que se posent des décideurs. La programmation stochastique et la programmation biniveau sont deux sous-domaines de la PM, permettant chacun de modéliser un aspect particulier de ces problèmes pratiques. Nous élaborons un modèle mathématique issu d'un problème appliqué, où les aspects biniveau et stochastique sont tous deux sollicités, puis procédons à une série de transformations du modèle. Une méthode de résolution est proposée pour le PM résultant. Nous démontrons alors théoriquement et vérifions expérimentalement la convergence de cette méthode. Cet algorithme peut être utilisé pour résoudre d'autres programmes biniveaux que celui qui est proposé.Le second thème de recherche de cette thèse s'intitule "problèmes de coupe et de couverture partielles dans les graphes". Les problèmes de coupe et de couverture sont parmi les problèmes de graphe les plus étudiés du point de vue complexité et algorithmique. Nous considérons certains de ces problèmes dans une variante partielle, c'est-à-dire que la propriété de coupe ou de couverture dont il est question doit être vérifiée partiellement, selon un paramètre donné, et non plus complètement comme c'est le cas pour les problèmes originels. Précisément, les problèmes étudiés sont le problème de multicoupe partielle, de coupe multiterminale partielle, et de l'ensemble dominant partiel. Les versions sommets des ces problèmes sont également considérés. Notons que les problèmes en variante partielle généralisent les problèmes non partiels. Nous donnons des algorithmes exacts lorsque cela est possible, prouvons la NP-difficulté de certaines variantes, et fournissons des algorithmes approchés dans des cas assez généraux. / This thesis is composed of two parts, each part belonging to a sub-domain of combinatorial optimization a priori distant from the other. The first research subject is stochastic bilevel programming. This term regroups two research subject rarely studied together, namely stochastic programming on the one hand, and bilevel programming on the other hand. Mathematical Programming (MP) is a set of modelisation and resolution methods, that can be used to tackle practical problems and help take decisions. Stochastic programming and bilevel programming are two sub-domains of MP, each one of them being able to model a specific aspect of these practical problems. Starting from a practical problem, we design a mathematical model where the bilevel and stochastic aspects are used together, then apply a series of transformations to this model. A resolution method is proposed for the resulting MP. We then theoretically prove and numerically verify that this method converges. This algorithm can be used to solve other bilevel programs than the ones we study.The second research subject in this thesis is called "partial cut and cover problems in graphs". Cut and cover problems are among the most studied from the complexity and algorithmical point of view. We consider some of these problems in a partial variant, which means that the cut or cover property that is looked into must be verified partially, according to a given parameter, and not completely, as it was the case with the original problems. More precisely, the problems that we study are the partial multicut, the partial multiterminal cut, and the partial dominating set. Versions of these problems were vertices are

Page generated in 0.1035 seconds