Related papers: Ordered Orthogonal Array Construction Using LFSR S…
Codes considered as structures within unit schemes greatly extends the availability of linear block and convolutional codes and allows the construction of these codes to required length, rate, distance and type. Properties of a code emanate…
In computer experiments, it has become a standard practice to select the inputs that spread out as uniformly as possible over the design space. The resulting designs are called space-filling designs and they are undoubtedly desirable…
Rational function approximations find applications in many areas including macro-modeling of high-frequency circuits, model order reduction for controller design, interpolation and extrapolation of system responses, surrogate models for…
The present study proposes a new Orthogonal Floating Search framework for structure selection of nonlinear systems by adapting the existing floating search algorithms for feature selection. The proposed framework integrates the concept of…
We consider the optimization problem of constructing a binary orthogonal array (OA) starting from a bigger one, by removing a specified amount of lines. In particular, we develop a genetic algorithm (GA) where the underlying chromosomes are…
We develop a numerical method to reconstruct systems of ordinary differential equations (ODEs) from time series data without {\it a priori} knowledge of the underlying ODEs using sparse basis learning and sparse function reconstruction. We…
Optical orthogonal codes (OOCs) are sets of $(0,1)$-sequences with good auto- and cross-correlation properties. They were originally introduced for use in multi-access communication, particularly in the setting of optical CDMA…
Frequency-hopping sequences (FHSs) with low Hamming correlation and wide gaps significantly contribute to the anti-interference performance in FH communication systems. This paper investigates FHSs with optimal Hamming correlation and…
Orientable sequences of order n are infinite periodic sequences with symbols drawn from a finite alphabet of size k with the property that any particular subsequence of length n occurs at most once in a period in either direction. They were…
Many topological data analysis (TDA) pipelines compute large collections of persistence diagrams, yet vectorizations and kernel methods discard the rank-induced implication relations among persistence intervals that are essential for…
In this study, we propose an approach to constructing on-off keying (OOK) symbols for wake-up radios (WURs) by using sequences in the frequency domain. The proposed method enables orthogonal multiplexing of wake-up signals (WUSs) and…
Enumerating nonisomorphic orthogonal arrays is an important, yet very difficult, problem. Although orthogonal arrays with a specified set of parameters have been enumerated in a number of cases, general results are extremely rare. In this…
Time series are ubiquitous in domains ranging from medicine to marketing and finance. Frequent Pattern Mining (FPM) from a time series has thus received much attention. Recently, it has been studied under the order-preserving (OP) matching…
In this paper, a general framework of constructing optimal frequency hopping sequence (FHS) sets is presented based on the designated direct product. Under the framework, we obtain infinitely many new optimal FHS sets by combining a family…
In this paper, we show how certain three-class association schemes and orthogonal arrays give rise to partial geometric designs. We also investigate the connections between partial geometric designs and certain regular graphs having three…
Linear models, such as force constant (FC) and cluster expansions, play a key role in physics and materials science. While they can in principle be parametrized using regression and feature selection approaches, the convergence behavior of…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…
A pair of orthogonal latin cubes of order $q$ is equivalent to an MDS code with distance $3$ or to an ${\rm OA}_1(3,5,q)$ orthogonal array. We construct pairs of orthogonal latin cubes for a sequence of previously unknown orders…
In this paper, the optimal power flow (OPF) problem is augmented to account for the costs associated with the load-following control of a power network. Load-following control costs are expressed through the linear quadratic regulator…