10,432 Hits in 6.2 sec

Sparse Sequential Dirichlet Coding [article]

Joel Veness, Marcus Hutter
2012 arXiv   pre-print
This short paper describes a simple coding technique, Sparse Sequential Dirichlet Coding, for multi-alphabet memoryless sources.  ...  occurring alphabet symbols.  ...  Acknowledgements The authors would like to thank Kee Siong Ng and Marc Bellemare for comments that helped improve this paper.  ... 
arXiv:1206.3618v1 fatcat:62buwuvksffnnfx6v5af6yrqtu

Hierarchical Alphabet and Parametric Channel Constrained Capacity Regions for HDF Strategy in Parametric Wireless 2-WRC

Jan Sykora, Alister Burr
2010 2010 IEEE Wireless Communication and Networking Conference  
This strategy uses a Hierarchical eXclusive Code (HXC) that allows full decoding of the hierarchical symbols at the relay.  ...  We evaluate the hierarchical MAC capacity regions for various alphabets, constellation point indexing and various channel parametrization and compare that to the alphabet limited and unconstrained cut-set  ...  The method is usable for evaluation of any summation or integration of the form I = f (x)g(x) dx. We consider f (x) as a PDF, and hence the integral can be evaluated as I = E f (x) [g(x) ].  ... 
doi:10.1109/wcnc.2010.5506416 dblp:conf/wcnc/SykoraB10 fatcat:ku74tpxcarhu7kiberr25gylpi

An information-theoretical approach to the information capacity and cost-effectiveness evaluation of color palettes

Refik Tanju Sirmen, Burak Berk Ustundag
2017 International Journal of Computing and Optimization  
Despite the possible effects upon diverse applications, a methodology for cost-effectiveness evaluation of palettes seems deficient.  ...  Besides, the proposed metrics are computed for some developed and known palettes, and observed results are evaluated.  ...  In the context, the message is encoded through the rules of a symbology, via the symbols of an alphabet. A symbol itself, is single or multi-colored mark of a particular pattern.  ... 
doi:10.12988/ijco.2017.759 fatcat:tx5ywyxbcfhozhtciazt56qly4

Page 66 of Library & Information Science Abstracts Vol. , Issue 2 [page]

1995 Library & Information Science Abstracts  
For abstracts of individual articles see this issue of LISA. SE 2122 An empirical evaluation of coding methods for multi-symbol alphabets. A. Moffat and others.  ...  The 2nd algorithm, suitable only for alphabets of less than 12 symbols, allows even greater reduction in the excess code length.  ... 

A classification framework for exploiting sparse multi-variate temporal features with application to adverse drug event detection in medical records

Francesco Bagattini, Isak Karlsson, Jonathan Rebane, Panagiotis Papapetrou
2019 BMC Medical Informatics and Decision Making  
While existing methods have been focusing on the exploitation of static features, limited attention has been given to temporal features.  ...  Therefore, it is of paramount importance to reduce the impact and prevalence of ADEs within the healthcare sector, not only since it will result in reducing human suffering, but also as a means to substantially  ...  Pharmacoepidemiology, for the valuable feedback and consultation regarding the evaluation of our findings.  ... 
doi:10.1186/s12911-018-0717-4 pmid:30630486 pmcid:PMC6327495 fatcat:hu3g2o7y4zaflag4avi7ya4a7i

Layered Design of Hierarchical Exclusive Codebook and Its Capacity Regions for HDF Strategy in Parametric Wireless 2-WRC

Jan Sykora, Alister Burr
2011 IEEE Transactions on Vehicular Technology  
We present a layered design of the HXC codebook which uses an arbitrary outer state-of-the-art capacity approaching code (e.g. LDPC) and an inner layer with an exclusive symbol alphabet.  ...  This strategy uses a Hierarchical eXclusive Code (HXC) that allows full decoding of the hierarchical symbols at the relay.  ...  It is evaluated for given chosen symbol alphabets A s with given channel parameters x = u (s(c A ) + hs(c B )) + w. (23) The hierarchical code symbols are mapped on the useful signal by u(c A , c B ) =  ... 
doi:10.1109/tvt.2011.2160105 fatcat:qq5ejcgg2bdz3inughcasnaajm

Alphabet Partitioning Techniques for Semiadaptive Huffman Coding of Large Alphabets

Dan Chen, Yi-Jen Chiang, Nasir Memon, Xiaolin Wu
2007 IEEE Transactions on Communications  
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix coding for each layer  ...  In this paper, we formulate the problem of finding an alphabet partitioning for the design of a two-layer semi-adaptive code as an optimization problem, and give a solution based on dynamic programming  ...  Acknowledgments We thank the anonymous reviewers for their valuable comments and suggestions that greatly improved this paper.  ... 
doi:10.1109/tcomm.2006.888894 fatcat:ndallmuegre3vojqcutzdoicfq

PhD Dissertation: Generalized Independent Components Analysis Over Finite Alphabets [article]

Amichai Painsky
2018 arXiv   pre-print
Independent component analysis (ICA) is a statistical method for transforming an observable multi-dimensional random vector into components that are as statistically independent as possible from each other  ...  ICA over finite fields is a special case of ICA in which both the observations and the independent components are over a finite alphabet.  ...  Thank you for taking part in this journey with me.  ... 
arXiv:1809.05043v4 fatcat:qo5cl7ui7zeetcpijrg43skkli

Maximum-likelihood decoding of device-specific multi-bit symbols for reliable key generation

Meng-Day Yu, Matthias Hiller, Srinivas Devadas
2015 2015 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)  
Each detected symbol is a letter in a codeword of an error correction code, resulting in non-binary codewords.  ...  We present simulation results demonstrating that for a given PUF noise level and block size (an estimate of helper data size), our new symbol-based ML approach can have orders of magnitude better bit error  ...  ECC changes from being strictly binary to non-binary, operating on an alphabet of α bits per symbol.  ... 
doi:10.1109/hst.2015.7140233 dblp:conf/host/YuHD15 fatcat:c7spmfpjhrcmfhy76s5lcqiike

On Families of New Adaptive Compression Algorithms Suitable for Time-Varying Source Data [chapter]

Luis Rueda, B. John Oommen
2004 Lecture Notes in Computer Science  
Once these probabilities are estimated, they can be used in a variety of data encoding schemes, and we have demonstrated this, in particular, for the adaptive Fano scheme and and an adaptive entropy-based  ...  In this paper, we introduce a new approach to adaptive coding which utilizes Stochastic Learning-based Weak Estimation (SLWE) techniques to adaptively update the probabilities of the source symbols.  ...  -Another potential model for the encoding models introduced in this paper is the extension of the encoding algorithms to multi-symbol code alphabets.  ... 
doi:10.1007/978-3-540-30198-1_24 fatcat:dketyqfs4beixl6wk3hc2hw33u

Universal lossless compression-based denoising

Han-I Su, Tsachy Weissman
2010 2010 IEEE International Symposium on Information Theory  
An approximation of the posterior distribution is derived from the universal probability assignment on the noisy process induced by a universal lossless compression code.  ...  Simulations show that when the source alphabet is small, the empirical conditional entropybased denoiser achieves the performance of the Universal Discrete DEnoiser (DUDE).  ...  We are currently working on comparing the convergence rate of the empirical conditional entropy-based denoiser and the DUDE, and on proving that universal lossless compression-based denoisers are universal  ... 
doi:10.1109/isit.2010.5513338 dblp:conf/isit/SuW10 fatcat:mt46chifvvf6jbg3ig5qr62m2u

Anomaly Detection for Symbolic Time Series Representations of Reduced Dimensionality

Konstantinos Bountrogiannis, George Tzagkarakis, Panagiotis Tsakalides
2020 Zenodo  
In this paper, we propose a computationally efficient, yet highly accurate, framework for anomaly detection of streaming data in lower-dimensional spaces, utilizing a modification of the symbolic aggregate  ...  From industrial to healthcare machines and wearable sensors, an unprecedented amount of data is becoming available for mining and information retrieval.  ...  Having generated the symbolic sequence of length M for the current window, the frequency distribution of the α alphabet symbols is calculated next for the M -sized sequence.  ... 
doi:10.5281/zenodo.4294535 fatcat:xgeuh4zx7fe5rnwpwjxjoyig24

Revisiting IPA-based Cross-lingual Text-to-speech [article]

Haitong Zhang, Haoyue Zhan, Yang Zhang, Xinyuan Yu, Yue Lin
2021 arXiv   pre-print
In this paper, we report some empirical findings of building a cross-lingual TTS model using IPA as inputs.  ...  Furthermore, we find that using a dataset including one speaker per language to build an IPA-based TTS system would fail CL VC since the language-unique IPA and tone/stress symbols could leak the speaker  ...  CONCLUSIONS In this study, we present an empirical study of building an IPA-based cross-lingual non-autoregressive TTS model. We conclude our findings as follows.  ... 
arXiv:2110.07187v2 fatcat:6eeihcdj65d4hh2hxyq3exu5fm

Deep learning predicts short non-coding RNA functions from only raw sequence data

Teresa Maria Rosaria Noviello, Francesco Ceccarelli, Michele Ceccarelli, Luigi Cerulo, Ilya Ioshikhes
2020 PLoS Computational Biology  
Compared to recent secondary structure based methods, the proposed solution is more robust to sequence boundary noise and reduces drastically the computational cost allowing for large data volume annotations  ...  Small non-coding RNAs (ncRNAs) are short non-coding sequences involved in gene regulation in many biological processes and diseases.  ...  As the authors of this method do not provide an executable tool, we were not able to evaluate the proposed method against our novel Rfam dataset.  ... 
doi:10.1371/journal.pcbi.1008415 pmid:33175836 fatcat:zgzugnbb5jaizkoggxtumya2ku

A Hidden Markov Model to detect coded information islands in free text

Luigi Cerulo, Michele Ceccarelli, Massimiliano Di Penta, Gerardo Canfora
2013 2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)  
In this paper we introduce an approach, based on Hidden Markov Models (HMMs), to extract coded information islands, such as source code, stack traces, and patches, from free text at a token level of granularity  ...  We evaluated our approach with respect to the state of art on a set of development emails and bug reports drawn from the software repositories of well known open source systems.  ...  Formally, a HMM is a quadruple (Σ, Q, T , E), where: • Σ is an alphabet of output symbols; • Q is a finite set of states capable of emitting output symbols from alphabet Σ; • T a set of transition probabilities  ... 
doi:10.1109/scam.2013.6648197 dblp:conf/scam/CeruloCPC13 fatcat:eykqzzukxncjxnq52wiso4na3q
« Previous Showing results 1 — 15 out of 10,432 results