No description available.

Ultra-wideband (UWB) is a wireless system which transmits signals across a much wider frequency spectrum than traditional wireless systems. The impulse radio (IR) UWB technique uses ultra-short duration pulses of nanoseconds or less. The objective of this thesis is to provide the design, implementation and testing of the timing recovery between the transmitter and receiver of the recently emerging differential code-shifted reference (DCSR) Impulse radio (IR) ultra-wideband (UWB) system. A new non-coherent energy detection based technique and its algorithm are proposed for timing recovery by means of a phase-locked loop (PLL) circuit. Simulations are presented first to verify the proposed algorithm. Then, it is implemented and tested in the Lattice ECP2 field-programmable gate array (FPGA) evaluation board with VHDL codes (a VHSIC hardware description language). The simulation and implementation results show that the proposed timing recovery scheme can be effectively achieved without much error.

Cette thèse propose des contributions très prometteuses au sujet du choix des primitives visuelles en asservissement visuel utilisant les moments 2D extraits de l'image. Nous avons proposé une nouvelle manière de résoudre un problème important en asservissement visuel, à savoir la commande du mouvement de rotation suivant les axes orthogonaux à l'axe optique. Ce travail représente une amélioration significative des travaux précédents en asservissement visuel basé sur l'utilisation des moments 2D extraits de l'image pour commander les degrés de liberté des robots manipulateurs. La commande la plus utilisée est connue sous le nom de commande cinématique. L'approche emploie un descripteur global d'image basé sur des moments 2D "shifted" dont les invariants calculés à partir de ces moments 2D "shifted" utilisent des moments d'ordre faible connus pour être robustes au bruit. De plus, ces invariants choisis ne dépendant pas de la forme de l'objet, sont invariants au mouvement de translation, de rotation et d'échelle. Cette nouvelle façon de faire vient ainsi résoudre les problèmes vus dans les travaux précédents relatifs aux choix des combinaisons des moments invariants basés sur les moments centrés et qui dépendent de la forme de l'objet considéré. Dans les travaux précédents, ces invariants sont calculés avec des moments dont l'ordre est compris entre trois et cinq qui sont vulnérables aux bruits de mesure. D'un point de vue asservissement visuel, le travail est basé sur la détermination explicite de la matrice d'interaction calculée à partir des moments 2D "shifted" dont le choix des paramètres de décalages respectent les propriétés d'invariances aux mouvements de translation, de rotation et d'échelle. En procédant ainsi, les informations visuelles choisies montrent la capacité de représenter les objets de formes symétriques et non symétriques. Des résultats de simulations sont présentés pour illustrer la validité de notre proposition.

abstract: We propose a novel solution to prevent cancer by developing a prophylactic cancer. Several sources of antigens for cancer vaccines have been published. Among these, antigens that contain a frame-shift (FS) peptide or viral peptide are quite attractive for a variety of reasons. FS sequences, from either mistake in RNA processing or in genomic DNA, may lead to generation of neo-peptides that are foreign to the immune system. Viral peptides presumably would originate from exogenous but integrated viral nucleic acid sequences. Both are non-self, therefore lessen concerns about development of autoimmunity. I have developed a bioinformatical approach to identify these aberrant transcripts in the cancer transcriptome. Their suitability for use in a vaccine is evaluated by establishing their frequencies and predicting possible epitopes along with their population coverage according to the prevalence of major histocompatibility complex (MHC) types. Viral transcripts and transcripts with FS mutations from gene fusion, insertion/deletion at coding microsatellite DNA, and alternative splicing were identified in NCBI Expressed Sequence Tag (EST) database. 48 FS chimeric transcripts were validated in 50 breast cell lines and 68 primary breast tumor samples with their frequencies from 4% to 98% by RT-PCR and sequencing confirmation. These 48 FS peptides, if translated and presented, could be used to protect more than 90% of the population in Northern America based on the prediction of epitopes derived from them. Furthermore, we synthesized 150 peptides that correspond to FS and viral peptides that we predicted would exist in tumor patients and we tested over 200 different cancer patient sera. We found a number of serological reactive peptide sequences in cancer patients that had little to no reactivity in healthy controls; strong support for the strength of our bioinformatic approach. This study describes a process used to identify aberrant transcripts that lead to a new source of antigens that can be tested and used in a prophylactic cancer vaccine. The vast amount of transcriptome data of various cancers from the Cancer Genome Atlas (TCGA) project will enhance our ability to further select better cancer antigen candidates. / Dissertation/Thesis / Ph.D. Molecular and Cellular Biology 2012

This thesis work consists of two different research projects. In the first project the optimization of the Frequency Shifted Reference-Ultrawideband (FSR-UWB) is discussed. After identifying the improvement areas in the FSR-UWB scheme, we performed analysis and proposed optimized values of the restricted integration and the front-end filter. It is observed that, by integrating the received signal over the entire symbol period, excess noise is allowed into the system and thus potentially degrades the performance. We showed that by restricting the integration period we get the expected gains in an Additive White Gaussian Noise (AWGN) channel but the gains are limited for a multipath fading channel. For these limited gains, the new integration block unnecessarily complicates the receiver structure. For front-end filter optimization the system performance is analyzed using a generic filter, h(t) and it is shown that a matched filter is the optimal filter for low values of Es/N0 whereas a unity gain band pass filter is optimal for high Es/N0 values, where Es is the symbol energy and N0/2 is the power spectral density of additive white Gaussian noise. In the second project we explored a general class of waveforms that can be used as separating waveforms to provide multiple-access for FSR-UWB systems. It is shown in this section that for single user scenario binary codes selected from {−1, 1} are optimal codes that can be used to separate data and the reference signals. For multiple-user access, a class of polynomials are discussed that can be used as separating waveform as they completely eliminate MAI. It is shown in the latter part that the optimal codes for multiple-user access are the binary codes selected from {−1, 1}. These codes are selected as the row vectors of the Hadamard Matrix. Simulation supported the application of this analysis to UWB systems, with either a small number of frames or operating over channels with small delay spread.

No description available.

No description available.

Cette thèse se situe au carrefour de la combinatoire énumérative, algébrique et bijective. Elle se consacre d’une part à traduire des problèmes algébriques en des problèmes combinatoires, et inversement, utilise le formalisme algébrique pour traiter des questions combinatoires.Après un rappel des notions classiques de combinatoire et de structures algébriques, nous abordons l’étude des tableaux de dominos décalés, qui sont des objets combinatoires définis dans le but de mieux comprendre la combinatoire des fonctions symétriques P et Q de Schur. Nous donnons la définition de ces tableaux et nous démontrons qu'ils sont en bijection avec les paires de tableaux de Young décalés. Cette bijection nous permet de voir ces objets comme des éléments du super monoïde plaxique décalé, qui est l'analogue décalé du super monoïde plaxique de Carré et Leclerc. Nous montrons aussi que ces tableaux décrivent un produit de deux fonctions P de Schur et en prenant un autre type de tableaux de dominos décalés, nous décrivons un produit de deux fonctions Q de Schur. Nous proposons aussi deux algorithmes d'insertion pour les tableaux de dominos décalés, analogues aux algorithmes d'insertion mixte et d'insertion gauche-droit de Haiman. Toujours dans le domaine de la combinatoire bijective, nous nous intéressons dans la deuxième partie de notre travail à des bijections en lien avec des statistiques sur les permutations et les nombres eulériens.Dans cette deuxième partie de thèse, nous introduisons l'unimodalité des suites finies associées aux différentes directions dans le triangle eulérien. Nous donnons dans un premier temps une interprétation combinatoire ainsi que la relation de récurrence des suites associées à la direction (1,t) dans le triangle eulérien, où t≥1. Ces suites sont les coefficients de polynômes appelés les polynômes eulériens avec succession d'ordre t, qui généralisent les polynômes eulériens. Nous démontrons par une bijection entre les permutations et des chemins nord-est étiquetés que ces suites sont log-concaves et donc unimodales. Puis nous prouvons que les suites associées aux directions (r,q), où r est un entier positif et q est un entier, tel que r+q≥0, sont aussi log-concaves et donc unimodales / This thesis is at the crossroads of enumerative, algebraic and bijective combinatorics. It studies some algebraic problems from a combinatorial point of view, and conversely, uses algebraic formalism to deal with combinatorial questions.After a reminder about classical notions of combinatoics and algebraic structures, We introduce new combinatorial objects called the shifted domino tableaux, these objects can be seen as a shifted analog of domino tableaux or as an extension of shifted Young tableaux. We prove that these objects are in bijection with pairs of shifted Young tableaux. This bijection shows that shifted domino tableaux can be seen as elements of the super shifted plactic monoid, which is the shifted analog of the super plactic monoid. We also show that the sum over all shifted domino tableaux of a fixed shape describe a product of two P-Schur functions, and by taking a different kind of shifted domino tableaux we describe a product of two Q-Schur functions. We also propose two insertion algorithms for shifted domino tablaux, analogous to Haiman's left-right and mixed insertion algorithms. Still in the field of bijective combinatorics, we are interested in the second part of our work with bijections related to statistics on permutations and Eulerian numbers.In this second part of this thesis, we introduce the unimodality of finite sequences associated to different directions in the Eulerian triangle. We first give a combinatorial interpretations as well as recurrence relations of sequences associated with the direction (1, t) in the Eulerian triangle, where t≥1. These sequences are the coefficients of polynomials called the t-successive eulerian polynomials, which generalize the eulerian polynomials. We prove using a bijection between premutations and north-east lattice paths that those sequences are unomodal. Then we prove that the sequences associated with the directions (r, q), where r is a positive integer and q is an integer such that r + q ≥ 0, are also log-concave and therefore unimodal

Submitted by Emanuel Varela Cardoso (emanuel.varela@ufcg.edu.br) on 2018-05-08T00:11:48Z No. of bitstreams: 1 NAYARA BRANDÃO DE FREITAS – DISSERTAÇÃO (PPGEE) 2016.pdf: 3718233 bytes, checksum: f4f88b8a316139fc246558ded5f688d9 (MD5) / Made available in DSpace on 2018-05-08T00:11:48Z (GMT). No. of bitstreams: 1 NAYARA BRANDÃO DE FREITAS – DISSERTAÇÃO (PPGEE) 2016.pdf: 3718233 bytes, checksum: f4f88b8a316139fc246558ded5f688d9 (MD5) Previous issue date: 2016-06-23 / O tema desenvolvido consiste no estudo, caracterização e análise de conversores multiníveis CA/CC/CA monofásicos/monofásicos, monofásicos/bifásicos e monofásicos/trifásicos aplicados a sistemas de conversão e compensação de energia, empregando IGBTs (Transistor Bipolar de Porta isolada) como dispositivos semicondutores. No decorrer do trabalho, diversas topologias são analisadas e comparadas utilizados critérios como quantidade de barramentos CC, valores das tensões dos barramentos CC, WTHD (Distorção Harmônica Total Ponderada) das tensões chaveadas, frequências de chaveamentos dos IGBTs e perdas por condução e chaveamento. Os sistemas de controle das variáveis dos conversores estudados são apresentados e o controle individual dos barramentos CC é abordado com destaque. Implementações experimentais foram utilizadas para comprovar a teoria apresentada e mostrar a viabilidade dos sistemas. / This work consists in the study, characterization, anda analysis of AC/DC/AC multilevel converters are applied to conversion and compensation systems and employ and IGBTs (Insulated Gate Bipolar Transistor) as power semiconductor device. Many topologies are analyzed and compared considering the number of DC-links, DC-links voltages values, WTHDs (Weighted Total Harmonic Distortion) of the generated voltages, and semiconductors conduction and switching losses. The control systems of the studied converters are presented and the individual control of the DC-links voltages in highlighted. Experimental results are provided in order to prove the theoretical results and the viability of the systems.

Thesis (MSc)--Stellenbosch University, 2011. / ENGLISH ABSTRACT: In several numerical approaches to PDEs shifted linear systems of the form (zI - A)x = b, need to be solved for several values of the complex scalar z. Often, these linear systems are large and sparse. This thesis investigates efficient numerical methods for these systems that arise from a contour integral approximation to PDEs and compares these methods with direct solvers. In the first part, we present three model PDEs and discuss numerical approaches to solve them. We use the first problem to demonstrate computations with a dense matrix, the second problem to demonstrate computations with a sparse symmetric matrix and the third problem for a sparse but nonsymmetric matrix. To solve the model PDEs numerically we apply two space discrerization methods, namely the finite difference method and the Chebyshev collocation method. The contour integral method mentioned above is used to integrate with respect to the time variable. In the second part, we study a Hessenberg reduction method for solving shifted linear systems with a dense matrix and present numerical comparison of it with the built-in direct linear system solver in SciPy. Since both are direct methods, in the absence of roundoff errors, they give the same result. However, we find that the Hessenberg reduction method is more efficient in CPU-time than the direct solver. As application we solve a one-dimensional version of the heat equation. In the third part, we present efficient techniques for solving shifted systems with a sparse matrix by Krylov subspace methods. Because of their shift-invariance property, the Krylov methods allow one to obtain approximate solutions for all values of the parameter, by generating a single approximation space. Krylov methods applied to the linear systems are generally slowly convergent and hence preconditioning is necessary to improve the convergence. The use of shift-invert preconditioning is discussed and numerical comparisons with a direct sparse solver are presented. As an application we solve a two-dimensional version of the heat equation with and without a convection term. Our numerical experiments show that the preconditioned Krylov methods are efficient in both computational time and memory space as compared to the direct sparse solver. / AFRIKAANSE OPSOMMING: In verskeie numeriese metodes vir PDVs moet geskuifde lineêre stelsels van die vorm (zI − A)x = b, opgelos word vir verskeie waardes van die komplekse skalaar z. Hierdie stelsels is dikwels groot en yl. Hierdie tesis ondersoek numeriese metodes vir sulke stelsels wat voorkom in kontoerintegraalbenaderings vir PDVs en vergelyk hierdie metodes met direkte metodes vir oplossing. In die eerste gedeelte beskou ons drie model PDVs en bespreek numeriese benaderings om hulle op te los. Die eerste probleem word gebruik om berekenings met ’n vol matriks te demonstreer, die tweede probleem word gebruik om berekenings met yl, simmetriese matrikse te demonstreer en die derde probleem vir yl, onsimmetriese matrikse. Om die model PDVs numeries op te los beskou ons twee ruimte-diskretisasie metodes, naamlik die eindige-verskilmetode en die Chebyshev kollokasie-metode. Die kontoerintegraalmetode waarna hierbo verwys is word gebruik om met betrekking tot die tydveranderlike te integreer. In die tweede gedeelte bestudeer ons ’n Hessenberg ontbindingsmetode om geskuifde lineêre stelsels met ’n vol matriks op te los, en ons rapporteer numeriese vergelykings daarvan met die ingeboude direkte oplosser vir lineêre stelsels in SciPy. Aangesien beide metodes direk is lewer hulle dieselfde resultate in die afwesigheid van afrondingsfoute. Ons het egter bevind dat die Hessenberg ontbindingsmetode meer effektief is in terme van rekenaartyd in vergelyking met die direkte oplosser. As toepassing los ons ’n een-dimensionele weergawe van die hittevergelyking op. In die derde gedeelte beskou ons effektiewe tegnieke om geskuifde stelsels met ’n yl matriks op te los, met Krylov subruimte-metodes. As gevolg van hul skuifinvariansie eienskap, laat die Krylov metodes mens toe om benaderde oplossings te verkry vir alle waardes van die parameter, deur slegs een benaderingsruimte voort te bring. Krylov metodes toegepas op lineêre stelsels is in die algemeen stadig konvergerend, en gevolglik is prekondisionering nodig om die konvergensie te verbeter. Die gebruik van prekondisionering gebasseer op skuif-en-omkeer word bespreek en numeriese vergelykings met direkte oplossers word aangebied. As toepassing los ons ’n twee-dimensionele weergawe van die hittevergelyking op, met ’n konveksie term en daarsonder. Ons numeriese eksperimente dui aan dat die Krylov metodes met prekondisionering effektief is, beide in terme van berekeningstyd en rekenaargeheue, in vergelyking met die direkte metodes.