22 papers · ranked by Valyu relevance
Qicheng Zeng, Zhaojun Nan, Sheng Zhou, T. Aaron Gulliver
Coded computing is recognized as a promising solution to address the privacy leakage problem and the straggling effect in distributed computing. This technique leverages coding theory to recover computation tasks using results from a subset of workers. In this paper, we propose the adaptive privacy-preserving coded…
Tuan Dinh, Kangwook Lee
Inspired by a new coded computation algorithm for invertible functions, we propose Coded-InvNet, a new approach to design resilient prediction serving systems that can gracefully handle stragglers or node failures. Coded-InvNet leverages recent findings in the deep learning literature such as invertible neural…
Jun Lu, Zhuo Zhang, Juan Mo
The conception of universal combinatorial coding is proposed. Relations exist more or less in many coding methods. It means that a kind of universal coding method is objectively existent. It can be a bridge connecting many coding methods. Universal combinatorial coding is lossless and it is based on the combinatorics…
Amir Said
Entropy coding, compression, complexity This introduction to arithmetic coding is divided in two parts. The first explains how and why arithmetic coding works. We start presenting it in very general terms, so that its simplicity is not lost under layers of implementation details. Next, we show some of its basic…
Paridhi Latawa, Nuh Aydın
| 1 | Abstract | | 2 | | --- | --- | --- | --- | | 2 | | Introduction | 2 | | 3 | | Convolutional Codes | 3 | | | 3.1 | Encoding of Binary Convolutional Codes | 3 | | | 3.2 | Decoding Convolutional Codes | 11 | | | 3.3 | Truncated Viterbi Decoding | 13 | | 4 | | DNA Codes | 17 | | | 4.1 | Constraints for the…
Kun Tu, Dariusz Puchala, Jun Chen, Sadaf Salehkalaibar
In this paper, we address the problem of m-gram entropy variable-to-variable coding, extending the classical Huffman algorithm to the case of coding m-element (i.e., m-grams) sequences of symbols taken from the stream of input data for $m>1$. We propose a procedure to enable the determination of the frequencies of the…
Jesús E. Garca, Verónica A. González-López, Gustavo H. Tasca, Karina Y. Yaginuma + 1 more
In the framework of coding theory, under the assumption of a Markov process $(X_{t})$ on a finite alphabet $A,$ the compressed representation of the data will be composed of a description of the model used to code the data and the encoded data. Given the model, the Huffman’s algorithm is optimal for the number of bits…
Ryosuke Sugiura, Masaaki Nishino, Norihito Yasuda, Yutaka Kamamoto + 1 more
'Takehiro Moriya'] This paper presents an optimal construction of N-bit-delay almost instantaneous fixed-to-variable-length (AIFV) codes, the general form of binary codes we can make when finite bits of decoding delay are allowed. The presented method enables us to optimize lossless codes among a broader class of codes…
Dániel L. Barabási, Taliesin Beynon
Artificial Intelligence (AI) research has provided key insights into the mechanics of learning complex tasks. However, AI models have long overlooked innateness: how strong pressures for survival lead to the encoding of complex behaviors in the nascent wiring of a brain. Although innate neural solutions have inspired…
Nikhil Krishnan, Dror Baron, M. Kıvanç Mıhçak
—We present a novel lossless universal source coding algorithm that uses parallel computational units to increase the throughput. The length-N input sequence is partitioned into B blocks. Processing each block independently of the other blocks can accelerate the computation by a factor of B, but degrades the…
Chengting Yu, Yujie Wu, Aili Wang, Wolfgang Maass
Hyperdimensional computing (HDC) addresses massively parallel implementations of symbolic computations that are both more transparent than ANNs and LLMs and more suitable for in-memory computing on highly energy-efficient analog hardware. It captures an essential aspects of brain computations: objects, concepts, and…
Christopher Myers, Ken Miyazaki, Thomas Trepl, Christine Isborn + 1 more
GPU-accelerated on-the-fly nonadiabatic dynamics is enabled by interfacing the linearized semiclassical dynamics approach with the TeraChem electronic structure program. We describe the computational workflow of the "PySCES" code interface, a Python code for semiclassical dynamics with on-the-fly electronic structure…
Authors not listed
While virtual libraries of synthetically accessible compounds have exploded in size to many billions, our capacity to extract valuable drug leads from these vast databases remains limited by computational resources. To overcome this, we developed SLICE SMARTS and Logic In ChEmistry), a powerful new tool designed for…
Kees Schouhamer Immink, Jos H. Weber, Tuan Thanh Nguyen, Kui Cai + 2 more
The design of low-complexity and efficient constrained codes has been a major research item for many years. This paper reports on a versatile method named concatenated constrained codes for designing efficient fixed-length constrained codes with small complexity. A concatenated constrained code comprises two (or more)…
Ian Holmes
We describe a strategy for constructing codes for DNA-based information storage by serial composition of weighted finite-state transducers. The resulting state machines can integrate correction of substitution errors; synchronization by interleaving watermark and periodic marker signals; conversion from binary to…
Fajia Sun, Long Qian
DNA has been pursued as a compelling medium for digital data storage during the past decade. While large-scale data storage and random access have been achieved in artificial DNA, the synthesis cost keeps hindering DNA data storage from popularizing into daily life. In this study, we proposed a more efficient paradigm…
Jin Yan, Yingying Zhu
Functional brain network has been widely studied in many previous work for brain disorder diagnosis and brain network analysis. However, most previous work focus on static dynamic brain network research. Lots of recent work reveals that the brain shows dynamic activity even in resting state. Such dynamic brain…
Ian Holmes
We describe a strategy for constructing codes for DNA-based information storage by serial composition of weighted finite-state transducers. The resulting state machines can integrate correction of substitution errors; synchronization by interleaving watermark and periodic marker signals; conversion from binary to…
Andrzej Chmielowiec, Paweł Litwin, Philip Broadbridge, Raúl Alcaraz
This article deals with compression of binary sequences with a given number of ones, which can also be considered as a list of indexes of a given length. The first part of the article shows that the entropy H of random n-element binary sequences with exactly k elements equal one satisfies the inequalities…
Winfield Chen, Lloyd T. Elliott
We improve the efficiency of population genetic file formats and GWAS computation by leveraging the distribution of sample ordering in population-level genetic data. We identify conditional exchangeability of these data, recommending finite state entropy algorithms as an arithmetic code naturally suited to population…
Yann Garniron, Thomas Applencourt, Kevin Gasperich, Anouar Benali + 15 more
Quantum Package is an open-source programming environment for quantum chemistry specially designed for wave function methods. Its main goal is the development of determinant-driven selected configuration interaction (sCI) methods and multi-reference second-order perturbation theory (PT2). The determinant-driven…
Yann Garniron, Thomas Applencourt, Kevin Gasperich, Anouar Benali + 15 more
Quantum Package is an open-source programming environment for quantum chemistry specially designed for wave function methods. Its main goal is the development of determinant-driven selected configuration interaction (sCI) methods and multi-reference second-order perturbation theory (PT2). The determinant-driven…