Related papers: Approximation capability of the convolution method…
We re-examine a practical aspect of combinatorial fuzzy problems of various types, including search, counting, optimization, and decision problems. We are focused only on those fuzzy problems that take series of fuzzy input objects and…
The performance of neural networks has been significantly improved by increasing the number of channels in convolutional layers. However, this increase in performance comes with a higher computational cost, resulting in numerous studies…
In this paper we aim to generalize results obtained in the framework of fractional calculus by the way of reformulating them in terms of operator theory. In its own turn, the achieved generalization allows us to spread the obtained…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
In granular computing, fuzzy sets can be approximated by granularly representable sets that are as close as possible to the original fuzzy set w.r.t. a given closeness measure. Such sets are called granular approximations. In this article,…
This paper studies a family of convolution quadratures, a numerical technique for efficient evaluation of convolution integrals. We employ the block generalized Adams method to discretize the underlying initial value problem, departing from…
The treatment of both aleatory and epistemic uncertainty by recent methods often requires an high computational effort. In this abstract, we propose a numerical sampling method allowing to lighten the computational burden of treating the…
We introduce a general theory of epistemic random fuzzy sets for reasoning with fuzzy or crisp evidence. This framework generalizes both the Dempster-Shafer theory of belief functions, and possibility theory. Independent epistemic random…
The article is dedicated to the analysis of the existing models for assessment based of the fuzzy logic centroid technique. A new Generalized Rectangular Model were developed. Some generalizations of the existing models are offered.
This paper deals with the resolutions of fuzzy relation equations with addition-min composition. When the fuzzy relation equations have a solution, we first propose an algorithm to find all minimal solutions of the fuzzy relation equations…
The purpose of this paper is to introduce several new convolution operators, generated by some known probability densities. By using the inverse Fourier transform and taking inverse steps (in the analogues of the classical procedures used…
We overview results on the topic of Poisson approximation that are missed in existing surveys. The topic of Poisson approximation to the distribution of a sum of integer-valued random variables is presented as well. We do not restrict…
In this paper, linear systems with a crisp real coefficient matrix and with a vector of fuzzy triangular numbers on the right-hand side are studied. A new method, which is based on the geometric representations of linear transformations, is…
Probably we have observed a new simple phenomena dealing with approximations to two real numbers.
We present an approximate converse theorem which measures how close a given set of irreducible admissible unramified unitary generic local representations of GL(n) is to a genuine cuspidal representation. To get a formula for the measure,…
The power of fuzz testing lies in its random, often brute-force, generation and execution of inputs to trigger unexpected behaviors and vulnerabilities in software applications. However, given the reality of infinite possible input…
In this study we compare Ces\`{a}ro and Euler weighted mean methods of summability of sequences of fuzzy numbers with Abel and Borel power series methods of summability of sequences of fuzzy numbers. Also some results dealing with series of…
In this paper, we introduce the notion of fuzzy soft numbers. Here defined fuzzy soft number and four arithmetic operations $ \tilde{+}, \tilde{-}, \tilde{\times}, \tilde{\div} $ and related properties. Also introduce Hausdorff distance,…
We consider numerical approximation to the solution of non-autonomous evolution equations. The order of convergence of the simplest possible Magnus method will be investigated.
Generalizations of some known results on the best, best linear and best one-sided approxima- tions by trigonometric polynomials of the classes of 2\pi - periodic functions presented in the form of convolutions to the case of set-valued…