相关论文: Computational Searching of Long Skew-symmetric Bin…
If the list of binary numbers is read by upward-sloping diagonals, the resulting ``sloping binary numbers'' 0, 11, 110, 101, 100, 1111, 1010, ... (or 0, 3, 6, 5, 4, 15, 10, ...) have some surprising properties. We give formulae for the n-th…
Once a gravitational wave signal is detected, the measurement of its source parameters is important to achieve various scientific goals. This is done through Bayesian inference, where the analysis cost increases with the model complexity…
The design of binary error-correcting codes is a challenging optimization problem with several applications in telecommunications and storage, which has also been addressed with metaheuristic techniques and evolutionary algorithms. Still,…
This paper presents results on maximal runs, order of squares, palindromes, and unbordered factors of members of the family of binary pattern sequences with the all-one pattern. Restricting ourselves to binary pattern sequences with the…
Similar subtrajectory search is a finer-grained operator that can better capture the similarities between one query trajectory and a portion of a data trajectory than the traditional similar trajectory search, which requires the two checked…
In their seminal paper [Sleator and Tarjan, J.ACM, 1985], the authors conjectured that the splay tree is dynamically optimal binary search tree (BST). In spite of decades of intensive research, the problem remains open. Perhaps a more basic…
We investigate the $k$-error linear complexity over $\mathbb{F}_p$ of binary sequences of length $2p$ with optimal three-level autocorrelation. These balanced sequences are constructed by cyclotomic classes of order four using a method…
Pseudorandom sequences are used extensively in communications and remote sensing. Correlation provides one measure of pseudorandomness, and low correlation is an important factor determining the performance of digital sequences in…
The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect. Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes…
In the last twenty years, data series similarity search has emerged as a fundamental operation at the core of several analysis tasks and applications related to data series collections. Many solutions to different mining problems work by…
High dimensional correlated binary data arise in many areas, such as observed genetic variations in biomedical research. Data simulation can help researchers evaluate efficiency and explore properties of different computational and…
Binary optimization, a representative subclass of discrete optimization, plays an important role in mathematical optimization and has various applications in computer vision and machine learning. Usually, binary optimization problems are…
A binary word is Sturmian if the occurrences of each letter are balanced, in the sense that in any two factors of the same length, the difference between the number of occurrences of the same letter is at most 1. In digital geometry,…
In a previous work it was shown that the best measure for the efficiency of a single burst-correcting code is obtained using the Gallager bound as opposed to the Reiger bound. In this paper, an efficient algorithm that searches for the best…
The presence of symmetries of binary programs typically degrade the performance of branch-and-bound solvers. In this article, we derive efficient variable fixing algorithms to discard symmetric solutions from the search space based on…
We study sublinear time algorithms for estimating the size of maximum matching. After a long line of research, the problem was finally settled by Behnezhad [FOCS'22], in the regime where one is willing to pay an approximation factor of $2$.…
In this paper, we present an optimal metric function on average, which leads to a significantly low decoding computation while maintaining the superiority of the polarization-adjusted convolutional (PAC) codes' error-correction performance.…
A search for spectroscopic binaries on the main sequence of the nearby globular cluster M4 has been undertaken with Argus, the multi-object spectrograph on the CTIO 4.0m telescope. A pair of radial velocities (median precision $\simeq$ 2…
In this paper, new pairs of binary sequences with three cross correlation values are presented. The cross correlation values are shown to be low. Finally we present some numerical results and some open problems.
Roughly every 2-10 minutes, a pair of stellar mass black holes merge somewhere in the Universe. A small fraction of these mergers are detected as individually resolvable gravitational-wave events by advanced detectors such as LIGO and…