Related papers: New extension constructions of optimal frequency h…
We study the transport properties of nonautonomous chaotic dynamical systems over a finite time duration. We are particularly interested in those regions that remain coherent and relatively non-dispersive over finite periods of time,…
To render a sequence testable, namely capable of identifying and detecting errors, it is necessary to apply a transformation that increases its length by introducing statistical dependence among symbols, as commonly exemplified by the…
We present a new construction of high dimensional expanders based on covering spaces of simplicial complexes. High dimensional expanders (HDXs) are hypergraph analogues of expander graphs. They have many uses in theoretical computer…
We introduce new method of optimization for finding free parameters of affine iterated function systems (IFS), which are used for fractal approximation. We provide the comparison of effectiveness of fractal and quadratic types of…
Considering a short frame length, which is typical in Ultra-Reliable Low-Latency and massive Machine Type Communications, a trade-off exists between improving the performance of frame synchronization (FS) and improving the performance of…
A new method for constructing minimum-redundancy binary prefix codes is described. Our method does not explicitly build a Huffman tree; instead it uses a property of optimal prefix codes to compute the codeword lengths corresponding to the…
Frequency synthesis (FS) is a technique vital for all kinds of radio frequency (RF) communications, such as: mobile phones, Bluetooth, Wi-Fi, radio, TV and satellite, and in other equipment requiring periodic signals of stable and…
In this paper we present a method for constructing the continuous best fractal approximation in the space of bounded functions. We construct the finite-dimensional subspace of the space of bounded functions whose base consists of the…
In this paper, we focus our attention on the high-dimensional double sparse linear regression, that is, a combination of element-wise and group-wise sparsity. To address this problem, we propose an IHT-style (iterative hard thresholding)…
The wide application of the modern resonant measurement techniques makes all the steps of the measuring process, including data acquisition more efficient and reliable. Here we investigate the multidimensional space of the parameters to…
Many complex systems occurring in the natural or social sciences or economics are frequently described on a microscopic level, e.g., by lattice- or agent-based models. To analyze the states of such systems and their bifurcation structure on…
By combining traditional frequency hopping ideas with the concepts of subcarriers and sampling points in OFDM baseband systems, this paper proposes a frequency hopping technology within the baseband called micro frequency hopping. Based on…
The problem of reconstructing a sequence of independent and identically distributed symbols from a set of equal size, consecutive, fragments, as well as a dependent reference sequence, is considered. First, in the regime in which the…
We present a general framework to construct symmetric, well-conditioned, cross-element compatible nodal distributions that can be used for high-order and high-dimensional finite elements. Starting from the inherent symmetries of an element…
We investigate partitioning of integer sequences into heapable subsequences (previously defined and established by Mitzenmacher et al). We show that an extension of patience sorting computes the decomposition into a minimal number of…
Preferential attachment --- by which new nodes attach to existing nodes with probability proportional to the existing nodes' degree --- has become the standard growth model for scale-free networks, where the asymptotic probability of a node…
The goal of Feature Selection - comprising filter, wrapper, and embedded approaches - is to find the optimal feature subset for designated downstream tasks. Nevertheless, current feature selection methods are limited by: 1) the selection…
We present new algorithms for the randomized construction of hierarchically semi-separable matrices, addressing several practical issues. The HSS construction algorithms use a partially matrix-free, adaptive randomized projection scheme to…
Extensible variants improve the modularity and expressiveness of programming languages: they allow program functionality to be decomposed into independent blocks, and allow seamless extension of existing code with both new cases of existing…
A new transform over finite fields, the finite field Hartley transform (FFHT), was recently introduced and a number of promising applications on the design of efficient multiple access systems and multilevel spread spectrum sequences were…