In this paper, we introduce the concepts of fuzzy pairwise (r, s)-irresolute, fuzzy pairwise (r, s)-presemiopen and fuzzy pairwise (r, s)-presemiclosed mappings in smooth bitopological spaces and then we investigate some of their characteristic properties.

in this paper, we extend and generalize some recent results on the strong laws of large numbers (slln) for pairwise independent random variables [3]. no assumption is made concerning the existence of independence among the random variables (henceforth r.v.’s). also chandra’s result on cesàro uniformly integrable r.v.’s is extended.

In this paper, we extend and generalize some recent results on the strong laws of large numbers (SLLN) for pairwise independent random variables [3]. No assumption is made concerning the existence of independence among the random variables (henceforth r.v.’s). Also Chandra’s result on Cesàro uniformly integrable r.v.’s is extended.

In this paper, we generalize some results of Chandra and Goswami [4] for pairwise negatively dependent random variables (henceforth r.v.’s). Furthermore, we give Baum and Katz’s [1] type results on estimate for the rate of convergence in these laws.

A tournament is a binary dominance relation on a set of alternatives. Tournaments arise in many contexts that are relevant to AI, most notably in voting (as a method to aggregate the preferences of agents). There are many works that deal with choice rules that select a desirable alternative from a tournament, but very few of them deal directly with incentive issues, despite the fact that gameth...

We consider lower bounding the maximum achievable rate of a differential unitary spacetime transmission subject to a prescribed performance. We characterize the performance using a suitably defined distance between two unitary matrices, which was previously obtained through pairwise error probability analysis. Considering the set of all unitary or orthogonal matrices as a compact manifold with ...

We present a family of adaptive pairwise tournaments which are provably robust against large error fractions when used to determine the largest element in a set. These tournaments use nk pairwise comparisons but have only O(k + log n) depth where n is the number of players and k is a robustness parameter (for reasonable values of n and k). We show how these tournaments can be used to prove mult...

This paper revisits the pairwise sorting network introduced by Parberry in the early 90’s. We provide a simple specification of the pairwise network which also clarifies its close resemblance to the more classic odd-even network introduced by Batcher in the mid 60’s. Finally we illustrate that pairwise networks are better suited than odd-even networks for the construction of selection networks.

In the study of fixed points of an operator it is useful to consider a more general concept, namely coupled fixed point. Edit In this paper, by using notion partial metric, we introduce a metric space $S$-Hausdorff on the set of all close and bounded subset of $X$. Then the fixed point results of multivalued continuous and surjective mappings are presented. Furthermore, we give a positive resul...

We introduce strong separation axioms in bitopological spaces. We also introduce the notion of strong pairwise compactness.