Related papers: An Improved Analytical Expression for Write Amplif…
We consider the additive white Gaussian noise channels. We prove that the error probability of decoding tends to one exponentially for rates above the capacity and derive the optimal exponent function. We shall demonstrate that the…
Data augmentation is an effective performance enhancement in neural machine translation (NMT) by generating additional bilingual data. In this paper, we propose a novel data augmentation enhancement strategy for neural machine translation.…
How stable is the performance of your flash-based Solid State Drives (SSDs)? This question is central for database designers and administrators, cloud service providers, and SSD constructors. The answer depends on write-amplification, i.e.,…
The inverse probability weighting (IPW) is broadly utilized to address missing data problems including causal inference but may suffer from large variances and biases due to propensity score model misspecification. To solve these problems,…
A primary source of increased read time on NAND flash comes from the fact that in the presence of noise, the flash medium must be read several times using different read threshold voltages for the decoder to succeed. This paper proposes an…
The C library \texttt{libkww} provides functions to compute the Kohlrausch-Williams-Watts function, i.e.\ the Laplace-Fourier transform of the stretched (or compressed) exponential function $\exp(-t^\beta)$ for exponents $\beta$ between 0.1…
Data augmentation is widely used in text classification, especially in the low-resource regime where a few examples for each class are available during training. Despite the success, generating data augmentations as hard positive examples…
Raw bit errors are common in NAND flash memory and will increase in the future. These errors reduce flash reliability and limit the lifetime of a flash memory device. We aim to improve flash reliability with a multitude of low-cost…
Non-volatile memory (NVM) technologies suffer from limited write endurance. To address this challenge, we propose Predict and Write (PNW), a K/V-store that uses a clustering-based machine learning approach to extend the lifetime of NVMs.…
This paper introduces a new numerical method for approximating the Lambert W function in the real domain. The method transforms the function into a simpler form that allows iterative refinement of an initial guess. Two iterative strategies…
The read channel of a Flash memory cell degrades after repetitive program and erase (P/E) operations. This degradation is often modeled as a function of the number of P/E cycles. In contrast, this paper models the degradation as a function…
We consider critical site percolation on the triangular lattice in the upper half-plane. Let $u_1, u_2$ be two sites on the boundary and $w$ a site in the interior of the half-plane. It was predicted by Simmons, Kleban and Ziff in a paper…
This paper summarizes our work on experimentally characterizing, mitigating, and recovering data retention errors in multi-level cell (MLC) NAND flash memory, which was published in HPCA 2015, and examines the work's significance and future…
Existing Math Word Problem (MWP) solvers have achieved high accuracy on benchmark datasets. However, prior works have shown that such solvers do not generalize well and rely on superficial cues to achieve high performance. In this paper, we…
Although read disturbance has emerged as a major reliability concern, managing read disturbance in modern NAND flash memory has not been thoroughly investigated yet. From a device characterization study using real modern NAND flash memory,…
Solutions to a wide variety of transcendental equations can be expressed in terms of the Lambert $\mathrm{W}$ function. The $\mathrm{W}$ function, occurring frequently in applications, is a non-elementary, but now standard mathematical…
The Lambert W function, implicitly defined by W(x) exp{W(x)}=x, is a "new" special function that has recently been the subject of an extended upsurge in interest and applications. In this note, I point out that the Lambert W function can…
For any infinite word $w$ on a finite alphabet $A$, the complexity function $p_w$ of $w$ is the sequence counting, for each non-negative $n$, the number $p_w(n)$ of words of length $n$ on the alphabet $A$ that are factors of the infinite…
The strong Lucas test is a widely used probabilistic primality test in cryptographic libraries. When combined with the Miller-Rabin primality test, it forms the Baillie-PSW primality test, known for its absence of false positives,…
Graph spanners and emulators are sparse structures that approximately preserve distances of the original graph. While there has been an extensive amount of work on additive spanners, so far little attention was given to weighted graphs.…