Related papers: Construction of three classes of Strictly Optimal …
In recent years, complementary sequence sets have found many important applications in multi-carrier code-division multiple-access (MC-CDMA) systems for their good correlation properties. In this paper, we propose a construction, which can…
The purpose of the article is to explain a new method to establish the existence of an exceptional collection of length three for a fake projective plane M with non-trivial automorphism group, related to a conjecture of…
A variety of statistical and machine learning methods are used to model crash frequency on specific roadways with machine learning methods generally having a higher prediction accuracy. Recently, heterogeneous ensemble methods (HEM),…
The $\Lambda$CDM model predicts structure formation across a vast mass range, from massive clusters ($\sim10^{15}\,\text{M}_\odot$) to Earth-mass micro-haloes ($\sim 10^{-6} \, \text{M}_\odot$), resolving which far exceeds the capabilities…
Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…
We mainly consider the frequency limited $\mathcal{H}_2$ optimal model order reduction of large-scale sparse generalized systems. For this purpose we need to solve two Sylvester equations. This paper proposes efficient algorithm to solve…
We study the structure of the set of all maximal green sequences of a finite-dimensional algebra. There is a natural equivalence relation on this set, which we show can be interpreted in several different ways, underscoring its…
The transport properties of discrete-time random walks on ring networks with deterministic shortcuts are investigated through analytical and numerical methods. The network consists of a periodic chain where each node is connected to its…
Given a set S of n keys, a k-perfect hash function (kPHF) is a data structure that maps the keys to the first m integers, where each output integer can be hit by at most k input keys. When m=n/k, the resulting function is called a minimal…
In this paper new infinite families of linear binary completely transitive codes are presented. They have covering radius $\rho = 3$ and 4, and are a half part of the binary Hamming and the binary extended Hamming code of length $n=2^m-1$…
We present a first order system least squares (FOSLS) method for the Helmholtz equation at high wave number k, which always deduces Hermitian positive definite algebraic system. By utilizing a non-trivial solution decomposition to the dual…
An optimal frame transmission scheme is presented for streaming scalable video over a link with limited capacity. The objective is to select a transmission sequence of frames and their transmission schedule such that the overall video…
In this paper, we consider a decentralized wireless communication network with a fixed number $u$ of frequency sub-bands to be shared among $N$ transmitter-receiver pairs. It is assumed that the number of active users is a random variable…
We introduce a novel ensemble approach for feature selection based on hierarchical stacking for non-stationarity and/or a limited number of samples with a large number of features. Our approach exploits the co-dependency between features…
The hopping ac conductance, which is realized at the transverse conductance minima in the regime of the integer Hall effect, has been measured using a combination of acoustic and microwave methods. Measurements have been made in the…
We introduce characteristic classes for the spectral sequence associated to a split short exact sequence of Hopf algebras. We show that these characteristic classes can be seen as obstructions for the vanishing of differentials in the…
First hitting times (FHTs) describe the time it takes a random "searcher" to find a "target" and are used to study timescales in many applications. FHTs have been well-studied for diffusive search, especially for small targets, which is…
Minimal perfect hash functions (MPHFs) are used to provide efficient access to values of large dictionaries (sets of key-value pairs). Discovering new algorithms for building MPHFs is an area of active research, especially from the…
Z-complementary code sets (ZCCSs) are used in multicarrier code-division multiple access (MC-CDMA) systems, for interference-free communication over multiuser and quasi-asynchronous environments. In this letter, we propose three new…
A new design method for high rate, fully diverse ('spherical') space frequency codes for MIMO-OFDM systems is proposed, which works for arbitrary numbers of antennas and subcarriers. The construction exploits a differential geometric…