Neelesh Shankar Upadhye

In this study, we construct a linear recurrent fractal interpolation function (RFIF) with variable scaling parameters for data set with α -stable noise (a generalization of Gaussian noise) on its ordinate, which captures the uncertainty at any missing or unknown intermediate point. The propagation of uncertainty in this linear RFIF is investigated, and a method for estimating parameters of the uncertainty at any interpolated value is provided. Moreover, a simulation study to visualize uncertainty for interpolated values is presented.

In this work, we analyze the maximum number of wireless transmitters (nodes) that can be scheduled subject to interference constraints across the nodes. Given a set of nodes, the problem reduces to finding the maximum cardinality of a subset that can concurrently transmit without violating interference constraints. The resulting packing problem is a binary optimization problem, which is NP hard. We propose a semi-definite (SDP) relaxation for the NP hard problem and discuss the algorithm and the quality of the relaxation by providing approximation ratios for the relaxation.

In this article, we use the linear recurrent fractal interpolation function approach to interpolate a data set with Gaussian noise on its ordinate. To investigate the variability at any intermediate point in the given noisy data set, we estimate the parameters of the probability distribution of the fractal function. In addition, we present a simulation study that experimentally confirms our theoretical findings.