Related papers: Correction to the 2005 paper: "Digit Selection for…
CRDT[24] Sets as implemented in Riak[6] perform poorly for writes, both as cardinality grows, and for sets larger than 500KB[25]. Riak users wish to create high cardinality CRDT sets, and expect better than O(n) performance for individual…
Among many existing algorithms, convergence methods are the most popular means of computing square root and the reciprocal of square root of numbers. An initial approximation is required in these methods. Look up tables (LUT) are employed…
Computing the rate-distortion function for continuous sources is commonly regarded as a standard continuous optimization problem. When numerically addressing this problem, a typical approach involves discretizing the source space and…
This paper has been withdrawn by the author due to an error in Lemma 3, making the (bijective) proof of Theorem 4 and Corollary 5 invalid (symmetry of k-nonnesting and k-noncrossing set partitions).
This paper has been withdrawn due to an error in the proof of Theorem 5.3.
This paper has been withdrawn by the author due to a crucial error in the proof of Theorem 1.
A more accurate, stable, finite-difference time-domain (FDTD) algorithm is developed for simulating Maxwell's equations with isotropic or anisotropic dielectric materials. This algorithm is in many cases more accurate than previous…
This paper presents new results about digital straight segments, their recognition and related properties. They come from the study of the arithmetically based recognition algorithm proposed by I. Debled-Rennesson and J.-P. Reveill\`es in…
In this paper, we propose a partitioning technique that decomposes a pair of sequences with overlapping $t$-deletion $s$-substitution balls into sub-pairs, where the $^{\leq}t$-burst-deletion balls of each sub-pair intersect. This…
In this small note we correct an error made by Mohammadi et al. in their paper entitled "On Skew Cyclic Codes Over A Finite Ring" ( Iranian Jl. Math. Sci. Inform. Vol 14 (1) (2019), 135-145).
Due to the limited number of bits in floating-point or fixed-point arithmetic, rounding is a necessary step in many computations. Although rounding methods can be tailored for different applications, round-off errors are generally…
In the paper [Hong-Shi Zong, Wei-Min Sun, Phys. Lett. B 640 (2006) 196], the authors claim that our proof of the inconsistency of the ladder approximation to QCD [Phys. Lett. B 611 (2005) 129] was incorrect. However, their claim is based on…
This paper has some inconsistent results, i.e., we made some failed claims because we did some mistakes for using the test criterion for a series. Precisely, our claims on the convergence rate of $\mathcal{O}(1/t)$ of SGD presented in…
Trees are fundamental data structure for many areas of computer science and system engineering. In this report, we show how to ensure eventual consistency of optimistically replicated trees. In optimistic replication, the different replicas…
Unfortunately, after an imprudent sumbission of the paper to the e-print archive, I discovered in it many serious mistakes. So I draw back it .
In this article we propose an optimal method referred to as SPlit for splitting a dataset into training and testing sets. SPlit is based on the method of Support Points (SP), which was initially developed for finding the optimal…
In recent years, several integer programming (IP) approaches were developed for maximum-likelihood decoding and minimum distance computation for binary linear codes. Two aspects in particular have been demonstrated to improve the…
How to obtain a model with good interpretability and performance has always been an important research topic. In this paper, we propose rectified decision trees (ReDT), a knowledge distillation based decision trees rectification with high…
Dating back to the seminal work of von Neumann [von Neumann, Automata Studies, 1956], it is known that error correcting codes can overcome faulty circuit components to enable robust computation. Choosing an appropriate code is non-trivial…
For scientific computations on a digital computer the set of real number is usually approximated by a finite set F of "floating-point" numbers. We compare the numerical accuracy possible with difference choices of F having approximately the…