Search results for "coding"
showing 10 items of 920 documents
PRINCIPAL POLYNOMIAL ANALYSIS
2014
© 2014 World Scientific Publishing Company. This paper presents a new framework for manifold learning based on a sequence of principal polynomials that capture the possibly nonlinear nature of the data. The proposed Principal Polynomial Analysis (PPA) generalizes PCA by modeling the directions of maximal variance by means of curves instead of straight lines. Contrarily to previous approaches PPA reduces to performing simple univariate regressions which makes it computationally feasible and robust. Moreover PPA shows a number of interesting analytical properties. First PPA is a volume preserving map which in turn guarantees the existence of the inverse. Second such an inverse can be obtained…
String attractors and combinatorics on words
2019
The notion of \emph{string attractor} has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors. A string attractor for a word $w=w[1]w[2]\cdots w[n]$ is a subset $\Gamma$ of the positions $\{1,\ldots,n\}$, such that all distinct factors of $w$ have an occurrence crossing at least one of the elements of $\Gamma$. While finding the smallest string attractor for a word is a NP-complete problem, it has been proved in [Kempa and Prezza, 2018] that dictionary compressors can be interpreted as algorithms approximating the smallest string attractor for a given word. In this paper we explore the noti…
Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform
2012
Motivation The Burrows-Wheeler transform (BWT) is the foundation of many algorithms for compression and indexing of text data, but the cost of computing the BWT of very large string collections has prevented these techniques from being widely applied to the large sets of sequences often encountered as the outcome of DNA sequencing experiments. In previous work, we presented a novel algorithm that allows the BWT of human genome scale data to be computed on very moderate hardware, thus enabling us to investigate the BWT as a tool for the compression of such datasets. Results We first used simulated reads to explore the relationship between the level of compression and the error rate, the leng…
Binary jumbled string matching for highly run-length compressible texts
2012
The Binary Jumbled String Matching problem is defined as: Given a string $s$ over $\{a,b\}$ of length $n$ and a query $(x,y)$, with $x,y$ non-negative integers, decide whether $s$ has a substring $t$ with exactly $x$ $a$'s and $y$ $b$'s. Previous solutions created an index of size O(n) in a pre-processing step, which was then used to answer queries in constant time. The fastest algorithms for construction of this index have running time $O(n^2/\log n)$ [Burcsi et al., FUN 2010; Moosa and Rahman, IPL 2010], or $O(n^2/\log^2 n)$ in the word-RAM model [Moosa and Rahman, JDA 2012]. We propose an index constructed directly from the run-length encoding of $s$. The construction time of our index i…
Rate-Splitting Random Access Mechanism for Massive Machine Type Communications in 5G Cellular Internet-of-Things
2021
The cellular Internet-of-Things has resulted in the deployment of millions of machine-type communication (MTC) devices. These massive number of devices must communicate with a single gNodeB (gNB) via the random access channel (RACH) mechanism. However, existing RACH mechanisms are inefficient when dealing with such large number of devices. To address this issue, we propose the rate-splitting random access (RSRA) mechanism, which uses rate splitting and decoding in rate-splitting multiple access (RSMA) to improve RACH success rates. The proposed mechanism divides the message into common and private messages and enhances the decoding performance. We demonstrate, using extensive simulations, t…
The DMT of Real and Quaternionic Lattice Codes and DMT Classification of Division Algebra Codes
2021
In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay asymmetric space-time codes. Such codes are less than full dimensional lattices in their natural ambient space. Apart from the multiple input single output (MISO) channel there exist very few methods to analyze the DMT of such codes. Further, apart from the MISO case, no DMT optimal asymmetric codes are known. We first discuss previous criteria used to analyze the DMT of space-time codes and comment on why these methods fail when applied to asymmetric codes. We then consider two special classes of asymmetric codes where the code-words are restricted to either real or quaternion matrices. We p…
Movement and Emotional Facial Expressions during the Adult Attachment Interview: Interaction Effects of Attachment and Anxiety Disorder
2019
<b><i>Introduction:</i></b> Adult attachment is commonly associated with emotion regulation. Less is known about the nonverbal embodiment of adult attachment. <b><i>Objective:</i></b> We hypothesized that dismissing attachment is related to less movement and fewer facial expressions of emotions, whereas preoccupied attachment is associated with more negative emotional facial expressions. Moreover, the interaction of attachment and the presence of an anxiety disorder (AD) was explored. <b><i>Methods:</i></b> The sample included 95 individuals, 21 with AD without comorbidity, 21 with AD and comorbid major depression (AD-C…
A generalized method for the design of ergodic sum-of-cisoids simulators for multiple uncorrelated rayleigh fading channels
2010
In this paper, we present a new method for the design of ergodic sum-of-sinusoids (SOS) simulation models for multiple uncorrelated Rayleigh fading channels. The method, which is intended for a special class of SOS models, known as sum-of-cisoids (SOC) models, can be used to generate an arbitrary number of uncorrelated Rayleigh fading waveforms with specified Doppler power spectral characteristics. This is in contrast to the SOS simulators currently available in the open literature that have been designed under the isotropic scattering assumption, which are limited to the simulation of uncorrelated channels characterized by Clarke's U-shaped Doppler power spectral density (DPSD). The excell…
desat1 and the Evolution of Pheromonal Communication in Drosophila
2009
1749-6632 (Electronic) 0077-8923; The evolution of communication is a fundamental biological problem. The genetic control of the signal and its reception must be tightly coadapted, especially in interindividual sexual communication. However, there is very little experimental evidence for tight genetic linkage connecting the emission of a signal and its reception. In Drosophila melanogaster, desat1 is the first known gene that simultaneously affects the emission and the perception of sex pheromones. Our experiments show that both aspects of pheromonal communication (the emission and the perception of sex pheromones) depend on distinct genetic control and may result from tissue-specific expre…
desat1: A Swiss army knife for pheromonal communication and reproduction?
2012
International audience; The desat1 gene possesses an extraordinary-maybe unique-feature in the control of sensory communication systems: it codes for the two principal and complementary aspects-the emission and the reception-of Drosophila sex pheromones. These two complex aspects depend on separate genetic control indicating that desat1 pleiotropically acts on pheromonal communication. This gene also control other characters either related to reproduction and to osmoregulation. Such a functional pleiotropy may be related to the molecular structure of desat1 gene which combines a highly conserved coding region with fast evolving regulatory regions: It produces at least five transcripts all g…