Related papers: Double Successive Rough Set Approximations
We consider the problem of approximating an unknown function $u\in L^2(D,\rho)$ from its evaluations at given sampling points $x^1,\dots,x^n\in D$, where $D\subset \mathbb{R}^d$ is a general domain and $\rho$ is a probability measure. The…
In this work, we Extend Pawlak approximation spaces by topological spaces. Also, Rough Membership, equality and inclusion relations are extended using topological near open sets. In addition, new extended measures of accuracy and quality of…
We develop a new approach for approximating large independent sets when the input graph is a one-sided spectral expander - that is, the uniform random walk matrix of the graph has its second eigenvalue bounded away from 1. Consequently, we…
The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…
A notion of rank developed previously by the author is used to describe two correspondences which classify small unitary representations of split real forms of $E_6$ and $E_7$. The case of small principal series is studied in detail.
In this paper we consider the classic scheduling problem of minimizing total weighted completion time on unrelated machines when jobs have release times, i.e, $R | r_{ij} | \sum_j w_j C_j$ using the three-field notation. For this problem, a…
In this note we investigate the operators associated with frame sequences in a Hilbert space $H$, i.e., the synthesis operator $T:\ell ^{2}(\mathbb{N}) \to H$, the analysis operator $T^{\ast}:H\to $ $% \ell ^{2}(\mathbb{N}) $ and the…
A lower semi-definite self-adjoint linear operator in a Hilbert space is taken whose discrete spectrum is not empty and comprises at least several eigenvalues $\lambda_{min}=\lambda_1\leqslant\ldots\leqslant\lambda_m<\sigma_{ess}$. The…
The paper investigates the computational problem of predicting RNA secondary structures. The general belief is that allowing pseudoknots makes the problem hard. Existing polynomial-time algorithms are heuristic algorithms with no…
In this paper, we study the existence of the random approximations and fixed points for random almost lower semicontinuous operators defined on finite dimensional Banach spaces, which in addition, are condensing or 1-set-contractive. Our…
For every natural number $n\geq 2$ and every finite sequence $L$ of natural numbers, we consider the set $UD_n(L)$ of all uniquely decodable codes over an $n$-letter alphabet with the sequence $L$ as the sequence of code word lengths, as…
Motivated by the problem to approximate all feasible schedules by one schedule in a given scheduling environment, we introduce in this paper the concepts of strong simultaneous approximation ratio (SAR) and weak simultaneous approximation…
The notion of singular reduction operators, i.e., of singular operators of nonclassical (conditional) symmetry, of partial differential equations in two independent variables is introduced. All possible reductions of these equations to…
We introduce hardness in relative entropy, a new notion of hardness for search problems which on the one hand is satisfied by all one-way functions and on the other hand implies both next-block pseudoentropy and inaccessible entropy, two…
In this paper, we shall investigate and analyse a new study on the best simultaneous approximation in the context of linear 2-normed spaces inspired by Elumalai and his coworkers in Elumalai. The basis of this investigation is to extend and…
Rough set theory, a mathematical tool to deal with inexact or uncertain knowledge in information systems, has originally described the indiscernibility of elements by equivalence relations. Covering rough sets are a natural extension of…
We define nonselfadjoint operator algebras with generators $L_{e_1},..., L_{e_n}, L_{f_1},...,L_{f_m}$ subject to the unitary commutation relations of the form \[ L_{e_i}L_{f_j} = \sum_{k,l} u_{i,j,k,l} L_{f_l}L_{e_k}\] where $u=…
We consider the precedence-constrained scheduling problem to minimize the total weighted completion time. For a single machine several $2$-approximation algorithms are known, which are based on linear programming and network flows. We show…
For any $\varepsilon > 0$, we give a polynomial-time $n^\varepsilon$-approximation algorithm for Max Independent Set in graphs of bounded twin-width given with an $O(1)$-sequence. This result is derived from the following time-approximation…
The LULU operators, well known in the nonlinear multiresolution analysis of sequences, are extended to functions defined on continuous domain, namely, a real interval $\Omega\subseteq\mathbb{R}$. Similar to their discrete counterparts, for…