Related papers: Bounded Generalized Mixture Functions
We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…
A weight function which $q$-generalizes the ground state wave function of the multi-component Calogero-Sutherland quantum many body system is introduced. Conjectures, and some proofs in special cases, are given for a constant term identity…
In this paper our aim is to present some subordination and superordination results, by using an operator, which involves the normalized form of the generalized Bessel functions of first kind. These results are obtained by investigating some…
The Ordered Weighted Averaging (OWA) operator is a traditional and commonly used criterion for aggregating discrete values of uncertain quantities. In this paper, it is shown that the discrete OWA naturally extends to the continuous case by…
Robust optimization aims to find optimum points from the collection of points that are feasible for every possible scenario of a given uncertain set. An optimum solution to a robust optimization problem is commonly found by the min-max…
In this paper we characterize (octal) bent generalized Boolean functions defined on $\BBZ_2^n$ with values in $\BBZ_8$. Moreover, we propose several constructions of such generalized bent functions for both $n$ even and $n$ odd.
In this work we extend to the interval-valued setting the notion of an overlap functions and we discuss a method which makes use of interval-valued overlap functions for constructing OWA operators with interval-valued weights. . Some…
This is a compendium of generating functions involving single, double sums and definite integrals. These generating functions also involve special functions in both the summand function and closed form solution.
Agda's standard library struggles in various places with n-ary functions and relations. It introduces congruence and substitution operators for functions of arities one and two, and provides users with convenient combinators for…
The weighted OWA (WOWA) is a function that aggregates a set of values with weights assigned based on the rank and relative importance of each value. The weighted OWA of uncertain objective functions can generalize many of the criteria that…
We prove inclusion relations between generalized Waterman's and generalized Wiener's classes for functions of two variable.
We compute bilinear integrals involving Macdonald and Gegenbauer functions. These integrals are convergent only for a limited range of parameters. However, when one uses generalized integrals they can be computed essentially without…
Recently, it has been shown that many functions on sets can be represented by sum decompositions. These decompositons easily lend themselves to neural approximations, extending the applicability of neural nets to set-valued inputs---Deep…
Convolution is a broadly useful operation with applications including signal processing, machine learning, probability, optics, polynomial multiplication, and efficient parsing. Usually, however, this operation is understood and implemented…
Multiobjective combinatorial optimization deals with problems considering more than one viewpoint or scenario. The problem of aggregating multiple criteria to obtain a globalizing objective function is of special interest when the number of…
The paper deals with a multiobjective combinatorial optimization problem with $K$ linear cost functions. The popular Ordered Weighted Averaging (OWA) criterion is used to aggregate the cost functions and compute a solution. It is well known…
We introduce another new type of combinations of Bernstein operators in this paper, which can be used to approximate the functions with inner singularities. The direct and inverse results of the weighted approximation of this new type…
When one tries to take into account the non-trivial vacuum structure of Quantum Field Theory, the standard functional-integral tools such as generating functionals or transitional amplitudes, are often quite inadequate for such purposes.…
In this paper a class of combinatorial optimization problems with uncertain costs is discussed. The uncertainty is modeled by specifying a discrete scenario set containing $K$ distinct cost scenarios. The Ordered Weighted Averaging (OWA for…
We design a low complexity distributed compression scheme for computing arbitrary functions of sources with discrete alphabets. We use a helper-based method that extends the definition of the G{\'a}cs-K{\"o}rner-Witsenhausen (GKW) common…