in this paper, the notions of $(t,s)$-composition matrix and$(t,s)$-interval-valued intuitionistic fuzzy equivalence matrix areintroduced where $(t,s)$ is a dual pair of triangular module. theyare the generalization of composition matrix and interval-valuedintuitionistic fuzzy equivalence matrix. furthermore, theirproperties and characterizations are presented. then a new methodbased on $tilde{...

We study L-categories of lattice-valued convergence spaces. Suchcategories are obtained by fuzzifying" the axioms of a lattice-valued convergencespace. We give a natural example, study initial constructions andfunction spaces. Further we look into some L-subcategories. Finally we usethis approach to quantify how close certain lattice-valued convergence spacesare to being lattice-valued topologi...

We explicitly identify the possible probability entrance laws for a class of measure-valued processes that are constructed by taking a particular measure-valued Markov branching process and conditioning it to stay away from the zero measure trap. The set of extreme points of the entrance space is larger than the state space of the conditioned process, and contains elements which correspond to "...

We establish the existence of a stochastic integral in a nuclear space setting as follows. Let E, F, and G be nuclear spaces which satisfy the following conditions: the spaces are reflexive, complete, bornological spaces such that their strong duals also satisfy these conditions. Assume that there is a continuous bilinear mapping of E × F into G. If H is an integrable, E-valued predictable proc...

This paper is devoted to consider the notions of complementary problem (CP) and set-valued complementary problem (SVCP). The set-valued complementary problem is compared with the classical single-valued complementary problem. Also, the solution set of the set-valued complementary problem is characterized. Our results illustrated by some examples. This paper is devoted to co...

This paper studies the construction of a refinement kernel for a given operator-valued reproducing kernel such that the vector-valued reproducing kernel Hilbert space of the refinement kernel contains that of the given kernel as a subspace. The study is motivated from the need of updating the current operator-valued reproducing kernel in multi-task learning when underfitting or overfitting occu...

Let p be a prime, and let f(x) be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the p-adic order of the sum ∑ k≡r (mod pβ) (n k ) (−1)f (⌊ k − r pα ⌋) , where α > β > 0, n > pα−1 and r ∈ Z. This polynomial extension of Fleck’s congruence has various backgrounds and several consequences such as ∑ k≡r (mod pα) (n k ) a ≡ 0 ( mod p ⌊ n−pα−1 φ(pα) ...

Let p be a prime, and let f (x) be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the p-adic order of the sum k≡r (mod p β) n k (−1) k f k − r p α , where α β 0, n p α−1 and r ∈ Z. This polynomial extension of Fleck's congruence has various backgrounds and several consequences such as k≡r (mod p α) n k a k ≡ 0 mod p n−p α−1 ϕ(p α) provided that ...

We give a classification of dual functions, they are m -al functions. We call a function m-al with respect to an operator if the operator lives any function unchanged after m times of using the operator. And 2 ≤ m ≤ k. Functions with different m have very different properties. We give theoretical results for clones of self-dual (m = 2) and selfk -al (m = k) functions in k -valued logic at k ≤ 3...

Computing certain answers is the preferred way of answering queries in scenarios involving incomplete data. This, however, is computationally expensive, so practical systems use efficient techniques based on a particular three-valued logic, although this often leads to